A subnetwork (graph) of a given network that connects all the nodes of the network and which has the property that once a path travels through a node, it cannot return to that node (the path has no cycles). A spanning tree is a tree of the network. If a network has n nodes, then the spanning tree has n − 1 arcs. Kruskal's algorithm; Minimum spanning tree problem; Network optimization; Primal algorithm; Prim's algorithm; Tree.
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
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Kluwer Academic Publishers
About this entry
Cite this entry
Gass, S.I., Harris, C.M. (2001). Spanning tree . In: Gass, S.I., Harris, C.M. (eds) Encyclopedia of Operations Research and Management Science. Springer, New York, NY. https://doi.org/10.1007/1-4020-0611-X_978
Download citation
DOI: https://doi.org/10.1007/1-4020-0611-X_978
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-7923-7827-3
Online ISBN: 978-1-4020-0611-1
eBook Packages: Springer Book Archive