Research Catalog

Treewidth : computations and approximations

Title
Treewidth : computations and approximations / Ton Kloks.
Author
Kloks, Ton.
Publication
Berlin ; New York : Springer-Verlag, ©1994.

Items in the Library & Off-site

Filter by

1 Item

StatusFormatAccessCall NumberItem Location
Request for On-site UseRequest Scan
How do I pick up this item and when will it be ready?
TextUse in library QA166.2 .K58 1994Off-site

Details

Description
ix, 209 pages : illustrations; 24 cm.
Summary
"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.
Series Statement
Lecture notes in computer science ; 842
Uniform Title
Lecture notes in computer science ; 842.
Subject
  • Trees (Graph theory) > Data processing
  • Baum Mathematik
  • Graphentheorie
  • Strukturbaum
  • Numerieke wiskunde
  • Grafentheorie
  • Computergraphics
  • Arbres (théorie des graphes)
Bibliography (note)
  • 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
  • 3540583564
  • 9783540583561
  • 0387583564
  • 9780387583563
LCCN
94031558
OCLC
  • ocm30894945
  • 30894945
  • SCSB-9185526
Owning Institutions
Princeton University Library