Self-stabilizing minimum spanning tree construction on message-passing networks

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

Volumn 2180, Issue , 2001, Pages 194-208

  Higham, Lisa ^a   Liang, Zhiying ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS;

ARBITRARY NETWORKS; DISTRIBUTED NETWORKS; MINIMUM SPANNING TREE PROBLEM; MINIMUM SPANNING TREES; SELF-STABILIZING ALGORITHM; SELF-STABILIZING DISTRIBUTED ALGORITHM; SPANNING TREE; TIME-OUTS;

MESSAGE PASSING;

EID: 84957018133     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45414-4_14     Document Type: Conference Paper

References (15)

1. Aggarwal, S., Kutten, S.: Time Optimal Self-Stabilizing Spanning Tree Algorithm. In FSTTCS93 Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 761. Springer-Verlag, (1993) 400–410
2. Antonoiu, G., Srimani, P.K.: A Self-Stabilizing Distributed Algorithm to Construct an Arbitrary Spanning Tree of a Connected Graph. Computers and Mathematics with Applications 30 (1995) 1–7
3. Antonoiu, G., Srimani, P.: Distributed Self-Stabilizing Algorithm for Minimum Spanning Tree Construction. Euro-par’97 Parallel Processing, Lecture Notes in Computer Science, Vol. 1300. Springer-Verlag, (1997) 480–487
4. Arora, A., Nesterenko, M.: Stabilization-Preserving Atomicity Refinement. Proceedings of DISC’99, Lecture Notes in Computer Science, Springer-Verlag, (1999) 254-268
5. Atallah, M.J.: Algorithms and Theory of Computation Handbook. CRC Press LLC (1999)
6. Beauquier, J., Datta, A.K., Gradinariu, M., Magniette, F.: Self-Stabilizing Local Mutual Exclusion and Daemon Refinement. Proceedings of DISC’00, Lecture Notes in Computer Science, Springer-Verlag, (2000) 223-237
7. Chen, N.S., Yu, H.P., Huang, S.T.: A Self-Stabilizing Algorithm for Constructing Spanning Trees. Information Processing Letters 39 (1991) 147–151
8. Dijkstra, E.W.: Self Stabilizing Systems in Spite of Distributed Control. Communications of the Association of the Computing Machinery 17 (1974) 643–644
9. Dolev, S., Israeli, A., Moran, S.: Self-Stabilization of Dynamic Systems Assuming Only Read/Write Atomicity. Distributed Computing 7 (1993) 3–16
10. Dolev, S.: Self-Stabilization. MIT Press, Cambridge (Massachusetts) London (2000)
11. Gallager, R., Humblet, P., Spira, P.: A Distributed Algorithm for Minimum Weight Spanning Trees. ACM Trans. On Prog. Lang. And Systems 5:1 (1983) 66–77
12. Gouda, M.G., Multari, N.: Stabilizing Communication Protocols. IEEE Trans. On Computers 40 (1991) 448–458
13. Huang, S.T., Chen, N.S.: A Self-Stabilizing Algorithm for Constructing Breadth- First Trees. Information Processing Letters 41 (1992) 109–117
14. Liang, Z.: Self-Stabilizing Minimum Spanning Trees. Technical Report UofC/TR/TR-2001-688-11, University of Calgary, Department of Computer Science (2001)
15. Sur, S., Srimani, P.K.: A Self-Stabilizing Distributed Algorithm for BFS Spanning Trees of a Symmetric Graph. Parallel Processing Letters 2 (1992) 171–179