Abstract
A country with n towns wants to construct a new telephone network to connect all towns. Of course, they don’t have to build a separate line between every pair of towns; but they do need to build a connected network; in our terms, this means that the graph of direct connections must form a connected graph. Let’s assume that they don’t want to build a direct line between towns that can be reached otherwise (there may be good reasons for doing so, as we shall see later, but at the moment let’s assume their only goal is to get a connected network). Thus they want to build a minimal connected graph with these nodes, i.e., a tree.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Lovász, L., Pelikán, J., Vesztergombi, K. (2003). Finding the Optimum. In: Discrete Mathematics. Undergraduate Texts in Mathematics. Springer, New York, NY. https://doi.org/10.1007/0-387-21777-0_9
Download citation
DOI: https://doi.org/10.1007/0-387-21777-0_9
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-95585-8
Online ISBN: 978-0-387-21777-2
eBook Packages: Springer Book Archive