|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996466117603316 |
|
|
Autore |
Kloks Ton |
|
|
Titolo |
Treewidth [[electronic resource] ] : Computations and Approximations / / by Ton Kloks |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 1994.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (X, 218 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 0302-9743 ; ; 842 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computers |
Algorithms |
Combinatorics |
Computer graphics |
Theory of Computation |
Algorithm Analysis and Problem Complexity |
Computer Graphics |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di contenuto |
|
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. |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
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 |
|
|
|
|