Treewidth

Computations and Approximations

Paperback Engels 1994 1994e druk 9783540583561
Verwachte levertijd ongeveer 9 werkdagen

Samenvatting

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.

Specificaties

ISBN13:9783540583561
Taal:Engels
Bindwijze:paperback
Aantal pagina's:218
Uitgever:Springer Berlin Heidelberg
Druk:1994

Lezersrecensies

Wees de eerste die een lezersrecensie schrijft!

Inhoudsopgave

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.

Managementboek Top 100

Rubrieken

    Personen

      Trefwoorden

        Treewidth