This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Awerbuch B (1987) Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems (detailed summary). In: Proceedings of the 19th annual ACM symposium on theory of computing, New York City. ACM, New York, pp 230–240
Borůvka O (2001) Otakar Borůvka on minimum spanning tree problem (translation of both the 1926 papers, comments, history). Discret Math 233: 3–36
Burns JE (1980) A formal model for message-passing systems, TR-91. Indiana University, Bloomington
Frederickson G, Lynch N (1984) The impact of synchronous communication on the problem of electing a leader in a ring. In: Proceedings of the 16th annual ACM symposium on theory of computing, Washington, DC. ACM, New York, pp 493–503
Gallager RG, Humblet PA, Spira PM (1983) A distributed algorithm for minimum-weight spanning trees. ACM Trans Prog Lang Syst 5(1): 66–77
Johansen KE, Jorgensen UL, Nielsen SH (1987) A distributed spanning tree algorithm. In: Proceedings of the 2nd international workshop on distributed algorithms (DISC), Amsterdam. Lecture notes in computer science, vol 312. Springer, Berlin/Heidelberg, pp 1–12
Korach E, Moran S, Zaks S (1984) Tight upper and lower bounds for some distributed algorithms for a complete network of processors. In: Proceedings of the 3rd symposium on principles of distributed computing (PODC), Vancouver. ACM, New York, pp 199–207
Korach E, Moran S, Zaks S (1985) The optimality of distributive constructions of minimum weight and degree restricted spanning trees in a complete network of processors. In: Proceedings of the 4th symposium on principles of distributed computing (PODC), Minaki. ACM, New York, pp 277–286
Lotker Z, Patt-Shamir B, Pavlov E, Peleg D (2005) Minimum-weight spanning tree construction in \(O(\log \log \ n)\) communication rounds. SIAM J Comput 35(1):120–131
Lotker Z, Patt-Shamir B, Peleg D (2006) Distributed MST for constant diameter graphs. Distrib Comput 18(6):453–460
Moses Y, Shimony B (2006) A new proof of the GHS minimum spanning tree algorithm. In: 20th international symposium on distributed computing (DISC), Stockholm, 18–20 Sept 2006. Lecture notes in computer science, vol 4167. Springer, Berlin/Heidelberg, pp 120–135
Wu BY, Chao KM (2004) Spanning trees and optimization problems. Discrete mathematics and its applications. Chapman Hall, Boca Raton
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Rajsbaum, S. (2016). Distributed Algorithms for Minimum Spanning Trees. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_116
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_116
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering