A distributed self-stabilizing algorithm for finding maximum matching

Computer Systems Science and Engineering

Volumn 15, Issue 3, 2000, Pages 175-180

  Karaata, Mehmet Hakan ^a   Saleh, Kassem Afif ^a  

^a KUWAIT UNIVERSITY   (Kuwait)

Author keywords

Distributed algorithms; Matching; Self stabilization; Trees

Indexed keywords

EID: 0012620417     PISSN: 02676192     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (22)

1. Aggarwal, S. and Kutten, S. Time optimal self-stabilizing spanning tree algorithms, Proc. 13th Conf. on Foundations of Software Technology and Theoretical Computer Science (1993) pp 87-91
2. Awerbuch, B. and Varghese, G. Distributed program checking: A paradigm for building self-stabilizing distributed protocols, Proc. 32nd IEEE Symposium on Foundations of Computer Science (1991)
3. Bondy, J. A. and Murty, U. S. R. Graph Theory with Applications, Elsevier (1976)
4. Burns, J. E. and Pachl, J. Uniform self-stabilizing rings, ACM Transactions on Programming Languages and Systems, 11 (1989) 330-344
5. Collin, Z and Dolev, S. Self-stabilizing depth-first search, Information Processing Letters, 49 (1994) 297-301
6. Dijkstra, E.W. Self-stabilizing systems in spite of distributed control, EWD 391, In: Selected Writings on Computing: A Personal Perspective (1973) pp 41-46
7. Dolev, S., Israeli, A. and Moran, S. Self-stabilization of dynamic systems assuming only read/write atomicity, Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing (1990) pp 103-118
8. Galil, Z. Efficient algorithms for finding maximum matchings in graphs, ACM Computing Surveys, 18(1) (1986)
9. Ghosh, S. and Karaata, M. H. A self-stabilizing algorithm for coloring planar graphs, Distributed Computing, 7(1) (1993) 55-59
10. Gibbons, A. Algorithmic Graph Theory, Cambridge University Press, Cambridge (1985)
11. Hsu, S. C. and Huang, S. T. A self-stabilizing algorithm for maximal matching, Information Processing Letters, 43 (1992) 77-81
12. Huang, S. T. Leader election in uniform rings, ACM Trans. Prog. Lang. Syst., 15 (1993) 563-573
13. Huang, S. T. and Chen, N. S. A self-stabilizing algorithm for constructing breadth-first trees, Inf. Process. Lett., 41 (1992)
14. Israeli, A. and Jalfon, M. Token management schemes and random walks yield self-stabilizing mutual exclusion, Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing (1990) pp 119-132
15. Karaata, M. H., Pemmaraju, S. V., Bruell, S. C. and Ghosh, S. Self-stabilizing algorithms for finding centers and medians of trees, ACM Annual Symposium on Principles of Distributed Computing (1994) p 37
16. Katz, S. and Perry, K.-J. Self-stabilizing extensions for message passing systems, Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing (1990) pp 91-101
17. Kruijer, H. S. M. Self-stabilization (in spite of distributed control) in tree-structured systems, Information Processing Letters, 8 (1979) 91-95
18. Lin, X. and Ghosh, S. Self-stabilizing maxima finding, Proceedings of the 28th Annual Allerton Conference (1991) pp 662-671
19. Micali, S. and Vazirani, V. V. An o(√|V̄| |e|) algorithm for finding maximum matchings in general graphs, Proceedings of the 21st IEEE Annual Symposium on Foundations of Computer Science (1980)
20. Schneider, M. Self-stabilization, ACM Computer Surveys, 25(1) (1993)
21. Sur, S. and Srimani, P. K. A self-stabilizing distributed algorithm for BFS spanning trees of a symmetric graph, Parallel Processing Letters, 2 (1992) 171-179
22. Yu, H. P. and Huang, S. T. A self-stabilizing algorithm for constructing spanning trees, Information Processing Letters, Vol 39 (1991)