LEADER 03604nam  22006375  450 
001 996466117603316
005 20200703035558.0
010   $a3-540-48672-0
024 7 $a10.1007/BFb0045375
035   $a(CKB)1000000000234161
035   $a(SSID)ssj0000327395
035   $a(PQKBManifestationID)11230854
035   $a(PQKBTitleCode)TC0000327395
035   $a(PQKBWorkID)10301356
035   $a(PQKB)10021428
035   $a(DE-He213)978-3-540-48672-5
035   $a(PPN)155193589
035   $a(EXLCZ)991000000000234161
100   $a20121227d1994      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aTreewidth$b[electronic resource] $eComputations and Approximations /$fby Ton Kloks
205   $a1st ed. 1994.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1994.
215   $a1 online resource (X, 218 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v842
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-58356-4 
327   $aand 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.
330   $aThis 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.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v842
606   $aComputers
606   $aAlgorithms
606   $aCombinatorics
606   $aComputer graphics
606   $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005
606   $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021
606   $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010
606   $aComputer Graphics$3https://scigraph.springernature.com/ontologies/product-market-codes/I22013
615  0$aComputers.
615  0$aAlgorithms.
615  0$aCombinatorics.
615  0$aComputer graphics.
615 14$aTheory of Computation.
615 24$aAlgorithm Analysis and Problem Complexity.
615 24$aCombinatorics.
615 24$aComputer Graphics.
676   $a511/.5
700   $aKloks$b Ton$4aut$4http://id.loc.gov/vocabulary/relators/aut$0714671
906   $aBOOK
912   $a996466117603316
996   $aTreewidth$91382013
997   $aUNISA