Abstract
In this chapter we will study the particular type of graph known as a tree, and investigate some applications of trees to practical problems. Trees arise in the problem of designing a communications network as cheaply as possible, and in the representation of hierarchical structures and decision processes, as well as in many other situations.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Copyright information
© 1995 Peter Grossman
About this chapter
Cite this chapter
Grossman, P. (1995). Trees. In: Discrete Mathematics for Computing. Palgrave, London. https://doi.org/10.1007/978-1-349-13908-8_11
Download citation
DOI: https://doi.org/10.1007/978-1-349-13908-8_11
Publisher Name: Palgrave, London
Print ISBN: 978-0-333-64694-6
Online ISBN: 978-1-349-13908-8
eBook Packages: EngineeringEngineering (R0)