Treewidth : computations and approximations
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 presen...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | Livre numérique |
| اللغة: | Anglais |
| منشور في: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| سلاسل: | Lecture notes in computer science
842 |
| الموضوعات: | |
| الوصول للمادة أونلاين: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| ملاحظة: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Treewidth, computations and approximations, Ton Kloks, Berlin, Springer-Verlag, 1994, 1 volume (IX-209 pages), Lecture notes in computer science, 0-387-58356-4 • Treewidth, Texte imprimé, 9783662164228 |
جدول المحتويات:
- 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.