A self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph

Computers and Mathematics with Applications

Volumn 35, Issue 10, 1998, Pages 15-23

  Antonoiu, G ^a   Srimani, P K ^a  

^a Colorado State University   (United States)

Author keywords

Correctness proof; Distributed algorithm self stabilization; Minimal spanning tree

Indexed keywords

CALCULATIONS; GRAPH THEORY; PROBLEM SOLVING; TREES (MATHEMATICS);

CORRECTNESS PROOF; DISTRIBUTED ALGORITHM SELF STABILIZATION; MINIMAL SPANNING TREE PROBLEM;

ALGORITHMS;

EID: 0032064387     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0898-1221(98)00068-6     Document Type: Article

References (16)

1. B.M. Maggs and S.A. Plotkin, Minimum-cost spanning tree as a path finding problem, Information Processing Letters 26, 291-293, (January 1988).
2. E.W. Dijkstra, Self-stabilizing systems in spite of distributed control, Communications of the ACM 17 (11), 643-644, (November 1974).
3. rd Annual ACM Symposium on Principles of Distributed Computing, pp. 1-11, (1984).
4. E.W. Dijkstra, A belated proof of self-stabilization, J. of Distributed Computing 1 (1), 5-6, (1986).
5. M. Gouda and T. Herman, Stabilizing unison, Inf. Processing Letters 35 (4), 171-175, (1990).
6. S. Sur and P.K. Srimani, A self-stabilizing distributed algorithm to construct BFS spanning tress of a symmetric graph, Parallel Processing Letters 2 (2/3), 171-180, (September 1992).
7. G.M. Brown, M.G. Gouda and C.L. Wu, Token systems that self-stabilize, IEEE Trans. Comput. 38 (6), 845-852, (June 1989).
8. M. Flatebo and A.K. Datta, Two-state self-stabilizing algorithms, In Proceedings of the IPPS-92, CA, (June 1992).
9. A. Arora, S. Dolev and M. Gouda, Maintaining digital clocks in step, Parallel Processing Letters 1 (1), 11-18, (1992).
10. M. Schneider, Self-stabilization, ACM Computing Surveys 25 (1), 45-67, (March 1993).
11. E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms, Computer Science Press, (1984).
12. N.S. Chen, H.P. Yu and S.T. Huang, A self-stabilizing algorithm for constructing spanning trees, Inf. Processing Letters 39 (3), 14-151, (1991).
13. S.T. Huang and N.-S. Chen, A self-stabilizing algorithm for constructing breadth first trees, Inf. Processing Letters 41, 109-117, (January 1992).
14. G. Antonoiu and P.K. Srimani, A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph, Computers Math. Applic. 30 (9), 1-7, (September 1995).
15. S. Aggrawal, Time optimal self-stabilizing spanning tree algorithms, Technical Report MIT/LCS/TR-632, Massachusetts Institute of Technology, (May 1994).
16. S. Chandrasekar and P K. Srimani, A self-stabilizing distributed algorithm for all-pairs shortest path problem, Parallel Algorithms and Applications 4 (1/2), 125-137, (1994).