Abstract
Minimal Spanning Tree (MST) problem in an arbitrary undirected graph is an important problem in graph theory and has extensive applications. Numerous algorithms are available to compute an MST. Our purpose here is to propose a self-stabilizing distributed algorithm for the MST problem and to prove its correctness. The algorithm utilizes an interesting result of [MP88]. We show the correctness of the proposed algorithm by using a new technique involving induction.
Chapter PDF
References
A. Arora, S. Dolev, and M. Gouda. Maintaining digital clocks in step. Parallel Processing Letters, 1(1):11–18, 1992.
S. Aggrawal. Time optimal self-stabilizing spanning tree algorithms. Technical Report MIT/LCS/TR-632, Massachusetts Institute of Technology, May 1994.
G. Antonoiu and P. K. Srimani. A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph. Computers Mathematics and Applications, 30(9):1–7, September 1995.
G. M. Brown, M. G. Gouda, and C. L. Wu. Token systems that self-stabilize. IEEE Trans. Comput., 38(6):845–852, June 1989.
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.
E. W. Dijkstra. Self-stabilizing systems in spite of distributed control. Communications of the ACM, 17(11):634–644, November 1974.
M. Flatebo and A. K. Datta. Two-State self-Stabilizing algorithms. In Proceedings of the IPPS-92, California, June 1992.
S.T. Huang and N.-S. Chen. A self-stabilizing algorithm for constructing breadth first trees. Inf. Processing Letters, 41:109–117, January 1992.
E. Horowitz and S. Sahni. Fundamentals of Computer Algorithms. Computer Science Press, 1984.
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.
B. M. Maggs and S. A. Plotkin. Minimum-cost spanning tree as a path finding problem. Information Processing Letters, 26:291–293, January 1988.
M. Schneider. Self-stabilization. ACM Computing Surveys, 25(1):45–67, March 1993.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Antonoiul, G., Srimani, P.K. (1997). Distributed self-stabilizing algorithm for minimum spanning tree construction. In: Lengauer, C., Griebl, M., Gorlatch, S. (eds) Euro-Par'97 Parallel Processing. Euro-Par 1997. Lecture Notes in Computer Science, vol 1300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0002773
Download citation
DOI: https://doi.org/10.1007/BFb0002773
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63440-9
Online ISBN: 978-3-540-69549-3
eBook Packages: Springer Book Archive