Spanning trees play an important role in the design of efficient routing algorithms and help solve computationally hard problems like the Steiner tree and the traveling salesperson problem. This is one of the most important concepts used in graph theory, as it forms the foundation of many theoretical results in practical fields like scheduling, clustering, data mining, and many others. Spanning Trees and Optimization Problems is the first book published on the use and applications associated with the modern study of spanning trees. It covers properties of spanning trees first, followed by the three categories of spanning trees: minimum spanning trees, shortest-paths trees, and minimum routing cost spanning trees.
Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.