---

＜電子ブック＞
Treewidth : Computations and Approximations / by Ton Kloks
(Lecture Notes in Computer Science. ISSN:16113349 ; 842)

版	1st ed. 1994.
出版者	(Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
出版年	1994
本文言語	英語
大きさ	X, 218 p : online resource
著者標目	*Kloks, Ton author SpringerLink (Online service)
件　名	LCSH:Computer science LCSH:Algorithms LCSH:Discrete mathematics LCSH:Computer graphics FREE:Theory of Computation FREE:Algorithms FREE:Discrete Mathematics FREE:Computer Graphics
一般注記	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 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 HTTP:URL=https://doi.org/10.1007/BFb0045375

 類似資料