Self-stabilizing distributed algorithm for strong matching in a system graph

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2913, Issue , 2003, Pages 66-73

  Goddard, Wayne ^a   Hedetniemi, Stephen T ^a   Jacobs, David P ^a   Srimani, Pradip K ^a  

^a Clemson University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY;

DISTRIBUTED NETWORKS; GRAPH-THEORETIC; SELF-STABILIZING ALGORITHM; SELF-STABILIZING DISTRIBUTED ALGORITHM; STRONG MATCHING;

GRAPH ALGORITHMS;

EID: 35248859753     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24596-4_8     Document Type: Article

References (13)

1. M Gradinariu and S Tixeuil. Self-stabilizing vertex coloration of arbitary graphs. In 4th International Conference On Principles Of DIstributed Systems, OPODIS'2000, pages 55-70. Studia Informatica Universalis, 2000.
2. S Dolev and JL Welch. Crash resilient communication in dynamic networks. IEEE Transactions on Computers, 46:14-26, 1997.
3. E. W. Dijkstra. Self-stabilizing systems in spite of distributed control. Communications of the ACM, 17(11):643-644, November 1974.
4. L. Lamport. Solved problems, unsolved problems, and non-problems in concurrency. In Proceedings of the 3rd Annual ACM Symposium on Principles of Distributed Computing, pages 1-11, 1984.
5. M. Schneider. Self-stabilization. ACM Computing Surveys, 25(1):45-67, March 1993.
6. T. Herman. A comprehensive bibliograph on self-stabilization, a working paper. Chicago J. Theoretical Comput. Sci., http://www.cs.uiowa.edu/ftp/selfstab/bibliography.
7. G Antonoiu and PK Srimani. Mutual exclusion between neighboring nodes in an arbitrary system graph tree that stabilizes using read/write atomicity. In EuroPar'99 Parallel Processing, Proceedings LNCS:1685, pages 823-830, 1999.
8. J Beauquier, AK Datta, M Gradinariu, and F Magniette. Self-stabilizing local mutual exclusion and daemon refinement. In DISC00 Distributed Computing 14th International Symposium, Springer LNCS:1914, pages 223-237, 2000.
9. M Nesterenko and A Arora. Stabilization-preserving atomicity refinement. In DISC99 Distributed Computing 13th International Symposium, Springer LNCS:1693, pages 254-268, 1999.
10. J. R. S. Blair and F. Manne. Efficient self-stabilizing algorithms for tree networks. In Proceedings of ICDCS-2003, Rhode Island, 2003.
11. S. T. Hedetniemi, D. P. Jacobs, and P. K. Srimani. Fault tolerant distributed coloring algorithms that stabilize in linear time. In Proceedings of the IPDPS-2002 Workshop on Advances in Parallel and Distributed Computational Models, pages 1-5, 2002.
12. K. Cameron. Induced matchings. Discrete Applied Mathematics, 24:97-102, 1989.
13. M. C. Golumbic and M. Lewenstein. New results in induced matchings. Discrete Applied Mathematics, 101(1-3):157-165, 2000.