Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Treewidth: Computations and Approximations

Treewidth: Computations and Approximations

Kloks, Ton

Paperback

Series: Lecture Notes in Computer Science, Book 842

General ComputersGeneral MathematicsProgramming

Currently unavailable to order

ISBN10: 3540583564
ISBN13: 9783540583561
Publisher: Springer Nature
Published: Aug 26 1994
Pages: 218
Weight: 0.72
Height: 0.48 Width: 6.14 Depth: 9.21
Language: English
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.

Also in

General Mathematics

View All