Consider a telephone company that wants to rent a subset from an existing set of cables, each of which connects two cities. The rented cables should suffice to connect all cities and they should be as cheap as possible. It is natural to model the network by a graph: the vertices are the cities and the edges correspond to the cables. By Theorem 2.4 the minimal connected spanning subgraphs of a given graph are its spanning trees.
CITATION STYLE
Korte, B., & Vygen, J. (2012). Spanning Trees and Arborescences (pp. 131–155). https://doi.org/10.1007/978-3-642-24488-9_6
Mendeley helps you to discover research relevant for your work.