A new self-stabilizing maximal matching algorithm

Angluin, 1980, Local and global properties in networks of processors (extended abstract), 82 Blair, 2003, Efficient self-stabilizing algorithms for tree networks, 20 Chattopadhyay, 2002, Dynamic and self-stabilizing distributed matching, 290 Dijkstra, 1974, Self-stabilizing systems in spite of distributed control., Commun. ACM, 17, 643, 10.1145/361179.361202 Dolev, 2000 Dolev, 1997, Superstabilizing protocols for dynamic distributed systems, Chicago J. Theor. Comput. Sci., 1997 Sukumar Ghosh, Arobinda Gupta, Mehmet H. Karaata, Sriram V. Pemmaraju, A self-stabilizing algorithm for maximal matching on trees, Technical Report TR-94-06, Department of Computer Science, The University of Iowa, Iowa City, 1994 Goddard, 2003, Self-stabilizing protocols for maximal matching and maximal independent sets for ad hoc networks, 162.2 Goddard, 2006, An anonymous self-stabilizing algorithm for 1-maximal matching in trees, vol. 2, 797 Gradinariu, 2001, Self-stabilizing neighborhood unique naming under unfair scheduler., vol. 2150, 458 Gradinariu, 2007, Conflict managers for self-stabilization without fairness assumption Hedetniemi, 2001, Maximal matching stabilizes in time o(m)., Inf. Process. Lett., 80, 221, 10.1016/S0020-0190(01)00171-5 Hsu, 1992, A self-stabilizing algorithm for maximal matching., Inf. Process. Lett., 43, 77, 10.1016/0020-0190(92)90015-N Manne, 2007, A self-stabilizing weighted matching algorithm, vol. 4838, 383 Tel, 1994, Maximal matching stabilizes in quadratic time., Inf. Process. Lett., 49, 271, 10.1016/0020-0190(94)90098-1