
Treewidth
Computations and Approximations
Ton Kloks(Author)
Springer (Publisher)
Published on 26. August 1994
Book
Paperback/Softback
X, 218 pages
978-3-540-58356-1 (ISBN)
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.
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.
More details
Series
Edition
1994 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
X, 218 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 13 mm
Weight
353 gr
ISBN-13
978-3-540-58356-1 (9783540583561)
DOI
10.1007/BFb0045375
Schweitzer Classification
Content
and basic terminology.- Preliminaries.- Testing superperfection of k-trees.- Triangulating 3-colored graphs.- Only few graphs have bounded treewidth.- Approximating treewidth and pathwidth of a graph.- Approximating treewidth and pathwidth for some classes of perfect graphs.- Treewidth of chordal bipartite graphs.- Treewidth and pathwidth of permutation graphs.- Treewidth of circle graphs.- Finding all minimal separators of a graph.- Treewidth and pathwidth of cocomparability graphs of bounded dimension.- Pathwidth of pathwidth-bounded graphs.- Treewidth of treewidth-bounded graphs.- Recognizing treewidth-bounded graphs.