Narrow your search
Listing 1 - 4 of 4
Sort by
Spanning trees and optimization problems
Authors: --- ---
ISBN: 1584884363 9781584884361 Year: 2004 Publisher: Boca Raton, FL ; London ; New York ; Washington, D.C. : ©2004 Chapman & Hall/CRC,

Loading...
Export citation

Choose an application

Bookmark

Abstract

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.

Trees and hills
Author:
ISBN: 0444875786 9780444875785 9780080872070 0080872077 1281788147 9786611788148 Year: 1984 Volume: 22 96 Publisher: Amsterdam New York New York, N.Y., U.S.A. North-Holland Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co.

Loading...
Export citation

Choose an application

Bookmark

Abstract

Trees and Hills: Methodology for Maximizing Functions of Systems of Linear Relations

Treewidth: computations and approximations
Author:
ISBN: 0387583564 3540583564 3540486720 Year: 1994 Volume: 842 Publisher: Berlin : Springer-Verlag,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This treatise investigates a number of problems related to treewidth and pathwidth of graphs. The main objective is to obtain good bounds on the complexity of determining the treewidth and pathwidth for various classes of graphs. Originating from the author's Ph.D. thesis, this monograph presents original own work. Nevertheless, many interesting perspectives beyond are presented. In total, the book is a smooth introduction to the topic of graphs of bounded treewidth. It will help to satisfy the strong interest among the algorithmic graph theory community in the theory pertaining to the topic. Particularly valuable is the thorough survey given of the relevant current literature.

CAAP 92. 17th colloquium on trees in algebra and programming, Rennes, France, February 26-28, 1992. Proceedings
Author:
ISBN: 3540552510 0387552510 3540467998 Volume: vol 581 Publisher: New York, NY : Springer-Verlag.

Listing 1 - 4 of 4
Sort by