In a network, a tree is a subnetwork (graph) that has no cycles and connects all nodes of a subnetwork, that is, a unique path exists between each node. A tree that connects all n nodes of a network is called a spanning tree and has (n − 1) arcs. Minimal spanning tree; Network optimization.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor 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). 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_1069
Download citation
DOI: https://doi.org/10.1007/1-4020-0611-X_1069
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