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.

Bibliographic Information

Book Title: Treewidth
Book Subtitle: Computations and Approximations
Editors: Ton Kloks
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/BFb0045375
Publisher: Springer Berlin, Heidelberg
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1994
Softcover ISBN: 978-3-540-58356-1Published: 26 August 1994
eBook ISBN: 978-3-540-48672-5Published: 11 April 2006
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: X, 218
Topics: Theory of Computation, Algorithm Analysis and Problem Complexity, Combinatorics, Computer Graphics

Publish with us

Policies and ethics

Treewidth

Overview

Access this book

Other ways to access

Table of contents (15 chapters)

Front Matter

Back Matter

Keywords

About this book

Bibliographic Information

Publish with us

Search

Navigation