A self-stabilizing algorithm for finding a spanning tree in a polynomial number of moves

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

Volumn 3911 LNCS, Issue , 2006, Pages 75-82

  Kosowski, Adrian ^a   Kuszner, Łukasz ^a  

^a GDANSK UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION ANALYSIS; MATHEMATICAL MODELS; POLYNOMIALS;

BROADCAST ROUTING; POLYNOMIAL NUMBER; SELF-STABILIZING ALGORITHMS; SPANNING TREE PROBLEM;

TREES (MATHEMATICS);

EID: 33745766088     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11752578_10     Document Type: Conference Paper

References (10)

1. Y. Afek, S. Kutten and M. Yung, Memory efficient self-stabilizing protocols for general networks, Proceedings of the 4th International Workshop on Distributed Algorithms, 1991, 15-28.
2. S. Aggarwal and S. Kutten, Time optimal self-stabilizing spanning tree algorithms, LNCS 761 (1993), 400-410.
3. A. Arora and M. Gouda, Distributed reset, IEEE Transactions on Computers, 43 (1994), 1026-1038.
4. E. W. Dijkstra, Self-stabilizing systems in spite of distributed control, Communication of the ACM 17 (1974), 643-644.
5. S. Dolev, M. Gouda and Marco Schneider, Memory requirements for silent stabilization. Acta Informatica 36 (1999), 447-462
6. S. Dolev, A. Israeli and S. Moran, Self-stabilization of dynamic system assuming only read/write atomicity, Distributed Computing 7 (1993), 3-16.
7. S. Ghosh, A. Gupta, and S. Pemmaraju, A fault-containing self-stabilizing algorithm for spanning trees, Journal of Computing and Information 2 (1996), 322-338.
8. S. Huang and N. Chen, A self-stabilizing algorithm for constructing breadth-first trees, Inform. Process. Lett. 41 (1992), 109-117.
9. C. Johnen, Memory Efficient, Self-Stabilizing algorithm to construct BFS spanning trees, Proc. of the third Workshop on Self-Stabilizing System (1997), 125-140.
10. S. Sur and P. K. Srimani, A self-stabilizing distributed algorithm to construct BFS spanning trees of a symmetric graph, Parallel Process. Lett. 2 (1992), 171-179.