Matches in Harvard for { <http://id.lib.harvard.edu/aleph/005207237/catalog> ?p ?o. }
Showing items 1 to 23 of
23
with 100 items per page.
- catalog abstract ""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."--PUBLISHER'S WEBSITE.".
- catalog contributor b7354409.
- catalog created "c1994.".
- catalog date "1994".
- catalog date "c1994.".
- catalog dateCopyrighted "c1994.".
- catalog 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."--PUBLISHER'S WEBSITE.".
- catalog description "1. Introduction and basic terminology -- 2. Preliminaries -- 3. Testing superperfection of k-trees -- 4. Triangulating 3-colored graphs -- 5. Only few graphs have bounded treewidth -- 6. Approximating treewidth and pathwidth of a graph -- 7. Approximating treewidth and pathwidth for some classes of perfect graphs -- 8. Treewidth of chordal bipartite graphs -- 9. Treewidth and pathwidth of permutation graphs -- 10. Treewidth of circle graphs -- 11. Finding all minimal separators of a graph -- 12. Treewidth and pathwidth of cocomparability graphs of bounded dimension -- 13. Pathwidth of pathwidth-bounded graphs -- 14. Treewidth of treewidth-bounded graphs -- 15. Recognizing treewidth-bounded graphs.".
- catalog description "Includes bibliographical references (p. [193]-206) and index.".
- catalog extent "ix, 209 p. :".
- catalog identifier "0387583564 (New York : acid-free paper)".
- catalog identifier "3540583564 (Berlin : acid-free paper)".
- catalog isPartOf "Lecture notes in computer science ; 842".
- catalog issued "1994".
- catalog issued "c1994.".
- catalog language "eng".
- catalog publisher "Berlin ; New York : Springer-Verlag,".
- catalog subject "511/.5 20".
- catalog subject "QA166.2 .K58 1994".
- catalog subject "Trees (Graph theory) Data processing.".
- catalog tableOfContents "1. Introduction and basic terminology -- 2. Preliminaries -- 3. Testing superperfection of k-trees -- 4. Triangulating 3-colored graphs -- 5. Only few graphs have bounded treewidth -- 6. Approximating treewidth and pathwidth of a graph -- 7. Approximating treewidth and pathwidth for some classes of perfect graphs -- 8. Treewidth of chordal bipartite graphs -- 9. Treewidth and pathwidth of permutation graphs -- 10. Treewidth of circle graphs -- 11. Finding all minimal separators of a graph -- 12. Treewidth and pathwidth of cocomparability graphs of bounded dimension -- 13. Pathwidth of pathwidth-bounded graphs -- 14. Treewidth of treewidth-bounded graphs -- 15. Recognizing treewidth-bounded graphs.".
- catalog title "Treewidth : computations and approximations / Ton Kloks.".
- catalog type "text".