The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs

Abstract We present the first polynomial self-stabilizing algorithm for finding a 1-maximal matching in a general graph. The previous best known algorithm has been presented by Manne et al. [20] and we show in this paper it has a sub-exponential time complexity under the distributed adversarial daemon. Our new algorithm is an adaptation of the Manne et al. algorithm and works under the same daemon, but with a complexity in O ( m × n 2 ) moves, with n is the number of nodes and m is the number of edges. This is the first self-stabilizing algorithm that solve this problem with a polynomial complexity. Moreover, our algorithm only needs one more boolean variable than the previous one.

[1]  Sébastien Tixeuil,et al.  A self-stabilizing 2/3-approximation algorithm for the maximum matching problem , 2011, Theor. Comput. Sci..

[2]  Shlomi Dolev,et al.  Self Stabilization , 2004, J. Aerosp. Comput. Inf. Commun..

[3]  Sébastien Tixeuil,et al.  An Efficient Silent Self-stabilizing 1-Maximal Matching Algorithm Under Distributed Daemon for Arbitrary Networks , 2017, SSS.

[4]  Ajoy Kumar Datta,et al.  Maximum Matching for Anonymous Trees with Constant Space per Process , 2015, OPODIS.

[5]  Johanne Cohen,et al.  Polynomial Self-Stabilizing Maximum Matching Algorithm with Approximation Ratio 2/3 , 2016, OPODIS.

[6]  Robert Preis,et al.  Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs , 1999, STACS.

[7]  Johanne Cohen,et al.  A Self-Stabilizing Algorithm for Maximal Matching in Anonymous Networks , 2016, Parallel Process. Lett..

[8]  Fredrik Manne,et al.  A Self-stabilizing Weighted Matching Algorithm , 2007, SSS.

[9]  Lisa Higham,et al.  Dynamic and self-stabilizing distributed matching , 2002, PODC '02.

[10]  Hamamache Kheddouci,et al.  A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs , 2010, J. Parallel Distributed Comput..

[11]  Shing-Tsaan Huang,et al.  A Self-Stabilizing Algorithm for Maximal Matching , 1992, Inf. Process. Lett..

[12]  Walid Saad,et al.  Matching Theory for Wireless Networks , 2017 .

[13]  Michiko Inoue,et al.  An Efficient Silent Self-Stabilizing Algorithm for 1-Maximal Matching in Anonymous Networks , 2015, WALCOM.

[14]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[15]  Volker Turau,et al.  A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2 , 2011, Theor. Comput. Sci..

[16]  Russell Martin,et al.  On the Stability of Dynamic Diffusion Load Balancing , 2007, Algorithmica.

[17]  Sébastien Tixeuil,et al.  An Efficient Silent Self-stabilizing 1-Maximal Matching Algorithm Under Distributed Daemon Without Global Identifiers , 2016, SSS.

[18]  Pradip K. Srimani,et al.  Maximal matching stabilizes in time O(m) , 2001, Inf. Process. Lett..

[19]  S. Muthukrishnan,et al.  Dynamic Load Balancing by Random Matchings , 1996, J. Comput. Syst. Sci..

[20]  Stefan Hougardy,et al.  A simple approximation algorithm for the weighted matching problem , 2003, Inf. Process. Lett..