Treewidth : computations and approximations / Ton Kloks.

Author
Kloks, Ton [Browse]
Format
Book
Language
English
Published/​Created
Berlin ; New York : Springer-Verlag, [1994], ©1994.
Description
ix, 209 pages : illustrations ; 23 cm.

Availability

Copies in the Library

Location Call Number Status Location Service Notes
ReCAP - Remote StorageQA166.2 .K58 1994 Browse related items Request

    Details

    Subject(s)
    Series
    Lecture notes in computer science ; 842. [More in this series]
    Bibliographic references
    Includes biblographical references and index.
    Contents
    • 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.
    ISBN
    0387583564
    LCCN
    94031558
    OCLC
    30894945
    RCP
    C - S
    Statement on language in description
    Princeton University Library aims to describe library materials in a manner that is respectful to the individuals and communities who create, use, and are represented in the collections we manage. Read more...

    Supplementary Information