Abstract
A minimum spanning tree of a weighted graph is its spanning tree T with a minimum total cost of edges in T of all possible spanning trees. Minimum spanning trees have many applications in computer networks. In this chapter, we investigate synchronous and asynchronous distributed algorithms to construct minimum spanning trees.
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
References
Awerbuch B (1987) Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems. In: Proc 19th ACM symp on theory of computing, pp 230–240
Chin F, Ting H (1985) An almost linear time and O(nlogn+e) messages distributed algorithm for minimum-weight spanning trees. In: Proc 26th IEEE symp foundations of computer science, pp 257–266
Gafni E (1985) Improvements in the time complexity of two message-optimal election algorithms. In: Proc of the 4th symp on principles of distributed computing, pp 175–185
Garay J, Kutten S, Peleg D (1998) A sublinear time distributed algorithm for minimum-weight spanning trees. SIAM J Comput 27:302–316
Khan M, Pandurangan G (2008) A fast distributed approximation algorithm for minimum spanning trees. Distrib Comput 6(20):391–402
Kutten S, Peleg D (1998) Fast distributed construction of k dominating sets and applications. J Algorithms 28:40–66
Peleg D (2000) Distributed computing: a locality-sensitive approach. SIAM, Philadelphia. ISBN 0-89871-464-8
Tel G (2000) Introduction to distributed algorithms, 2nd edn. Cambridge University Press, Cambridge
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag London
About this chapter
Cite this chapter
Erciyes, K. (2013). Minimum Spanning Trees. In: Distributed Graph Algorithms for Computer Networks. Computer Communications and Networks. Springer, London. https://doi.org/10.1007/978-1-4471-5173-9_6
Download citation
DOI: https://doi.org/10.1007/978-1-4471-5173-9_6
Publisher Name: Springer, London
Print ISBN: 978-1-4471-5172-2
Online ISBN: 978-1-4471-5173-9
eBook Packages: Computer ScienceComputer Science (R0)