Abstract
The maximal matching problem has received considerable attention in the self-stabilizing community. Previous work has given different self-stabilizing algorithms that solves the problem for both the adversarial and fair distributed daemon, the sequential adversarial daemon, as well as the synchronous daemon. In the following we present a single self-stabilizing algorithm for this problem that unites all of these algorithms in that it stabilizes in the same number of moves as the previous best algorithms for the sequential adversarial, the distributed fair, and the synchronous daemon. In addition, the algorithm improves the previous best moves complexities for the distributed adversarial daemon from O(n 2) and O(δm) to O(m) where n is the number of processes, m is the number of edges, and δ is the maximum degree in the graph.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Blair, J., Manne, F.: Efficient self-stabilzing algorithms for tree networks. In: ICDS, pp. 20–26. IEEE Computer Society Press, Los Alamitos (2003)
Chattopadhyay, S., Higham, L., Seyffarth, K.: Dynamic and self-stabilizing distributed matching. In: PODC, pp. 290–297 (2002)
Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17(11), 643–644 (1974)
Dolev, S.: Self Stabilization. MIT Press, Cambridge (March 2000)
Goddard, W., et al.: Self-stabilizing protocols for maximal matching and maximal independent sets for ad hoc networks. In: IPDPS, p. 162. IEEE Computer Society Press, Los Alamitos (2003)
Goddard, W., Hedetniemi, S.T., Shi, Z.: An anonymous self-stabilizing algorithm for 1-maximal matching in trees. In: Arabnia, H.R. (ed.) PDPTA, pp. 797–803. CSREA Press (2006)
Gradinariu, M., Johnen, C.: Self-stabilizing neighborhood unique naming under unfair scheduler. In: Sakellariou, R., et al. (eds.) Euro-Par 2001. LNCS, vol. 2150, pp. 458–465. Springer, Heidelberg (2001)
Gradinariu, M., Tixeuil, S.: Conflict managers for self-stabilization without fairness assumption. Technical Report 1459, LRI, Université Paris Sud (September 2006)
Hedetniemi, S.T., Jacobs, D.P., Srimani, P.K.: Maximal matching stabilizes in time o(m). Inf. Process. Lett. 80(5), 221–223 (2001)
Hsu, S.-C., Huang, S.-T.: A self-stabilizing algorithm for maximal matching. Inf. Process. Lett. 43(2), 77–81 (1992)
Karaata, M.H., Saleh, K.A.: Distributed self-stabilizing algorithm for finding maximum matching. Comput. Syst. Sci Eng. 15(3), 175–180 (2000)
Tel, G.: Maximal matching stabilizes in quadratic time. Inf. Process. Lett 49(6), 271–272 (1994)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Manne, F., Mjelde, M., Pilard, L., Tixeuil, S. (2007). A New Self-stabilizing Maximal Matching Algorithm. In: Prencipe, G., Zaks, S. (eds) Structural Information and Communication Complexity. SIROCCO 2007. Lecture Notes in Computer Science, vol 4474. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72951-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-72951-8_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72918-1
Online ISBN: 978-3-540-72951-8
eBook Packages: Computer ScienceComputer Science (R0)