| Treewidth: Computations and Approximations 1994 Edition Contributor(s): Kloks, Ton (Author) |
|
 |
ISBN: 3540583564 ISBN-13: 9783540583561 Publisher: Springer OUR PRICE: $52.24 Product Type: Paperback - Other Formats Published: August 1994 Annotation: 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. |
| Additional Information |
| BISAC Categories: - Mathematics | Graphic Methods - Computers | Computer Science - Computers | Computer Graphics |
| Dewey: 511.5 |
| LCCN: 94031558 |
| Series: Lecture Notes in Computer Science |
| Physical Information: 0.48" H x 6.14" W x 9.21" (0.72 lbs) 218 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: 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. |