Dynamic and self-stabilizing distributed matching

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2002, Pages 290-297

  Chattopadhyay, Subhendu ^a   Higham, Lisa ^a   Seyffarth, Karen ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY;

BIPARTITE NETWORK; DISTRIBUTED ALGORITHM; QUADRATIC TIME COMPLEXITY; SELF STABILIZING ALGORITHM; SEQUENTIAL ALGORITHM;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0036954650     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/571873.571877     Document Type: Conference Paper

References (15)

1. J. Beauquier, A.K. Datta, M. Gradinariu, and F. Magniette. Self-stabilizing local mutual exclusion and daemon refinement. 14th International Symposium on Distributed Computing, DISC00, 223-237, 2000.
2. C. Berge. Two theorems in graph theory. Proc. Nat. Acad. Sci. U.S.A., 43:842-844, 1957.
3. S. Chattopadnyay, L. Higham, and K. Seyffarth. Dynamic and self-stabilizing distributed matching. Technical Report 2002-704-07, Department of Computer Science, University of Calgary, Canada, 2002.
4. E.W. Dijkstra. Self-stabilization in spite of distributed control. In Selected Writings on Computing: A Personal Perspective, pages 41-46. Springer-Verlag, 1982. Original year of publication of the paper is 1973.
5. S. Dolev. Self-Stabilization. The MIT Press, 2000.
6. S. Dolev, A. Israeli, and S. Moran. Self stabilization of dynamic systems. In Proceedings of the MCC Workshop on Self-Stabilizing Systems, MCC Technical Report No. STP-379-89, 1989.
7. J. Edmonds. Paths, trees and flowers. Canad. J. Math, pages 449-67, 1965.
8. M. Gardinariu and C. Johnen. Self-stabilizing neighbourhood unique naming under unfair schedular. In Euro-Par 2001, volume 2150, pages 458-465. Springer-Verlag, 2001.
9. S.T. Hedetniemi, D.P. Jacobs, and P.K. Srimani. Maximal matching stabilizes in time O(m). IPL. 80:221-223, 2001.
10. 5/2 algorithm for maximum matching in bipartite graphs. SIAM J. on Computing, 2:225-31, 1973.
11. S.-C. Hsu and S.-T. Huang. A self-stabilizing algorithm for maximal matching. IPL, 43:77-81, 1992.
12. M.H. Karaata and K.A. Saleh. A distributed self-stabilizing algorithm for finding maximum matching. Computer Systems Science and Engineering, 3:175-180, 2000.
13. C.H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, 1982.
14. G. Tel. Maximal matching stabilizes in quadratic time. IPL, 49:271-272, 1994.
15. D.B. West. Introduction to Graph Theory. Prentice-Hall, 2001.