Spanning trees play an important role in the design of efficient routingalgorithms and help solve computationally hard problems like the Steiner treeand the tra... » 

Spanning trees play an important role in the design of efficient routingalgorithms and help solve computationally hard problems like the Steiner treeand the traveling salesperson problem. This is one of the most importantconcepts used in graph theory as it forms the foundation of many theoreticalresults in practical fields like scheduling clustering data mining and manyothers. Spanning Trees and Optimization Problems is the first book published onthe use and applications associated with the modern study of spanning trees. Itcovers properties of spanning trees first followed by the three categories ofspanning trees minimum spanning trees shortestpaths trees and minimumrouting cost spanning trees. «