Abstract
Spanning trees have many applications in computer networks as they provide a subgraph of less number of links than the original network resulting in lowered communications. This chapter introduces the basic distributed algorithms to construct spanning trees of graphs without any particular optimization objective.
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
Gafni E (1986) Perspectives on distributed network protocols: a case for building blocks. In: Proc. IEEE MILCOM
Kshemkalyani K, Singhal M (2007) Distributed computing: principles, algorithms, and systems. Cambridge University Press, Cambridge
Segall A (1983) Distributed network protocols. IEEE Trans Inf Theory 29(1):23–35
Tary G (1895) Le problème des labyrinthes. Nouv Ann Math 14
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). Spanning Tree Construction. In: Distributed Graph Algorithms for Computer Networks. Computer Communications and Networks. Springer, London. https://doi.org/10.1007/978-1-4471-5173-9_4
Download citation
DOI: https://doi.org/10.1007/978-1-4471-5173-9_4
Publisher Name: Springer, London
Print ISBN: 978-1-4471-5172-2
Online ISBN: 978-1-4471-5173-9
eBook Packages: Computer ScienceComputer Science (R0)