𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Treewidth: Computations and Approximations

✍ Scribed by Ton Kloks (eds.)


Book ID
127453992
Publisher
Springer
Year
1994
Tongue
English
Weight
1 MB
Edition
1
Category
Library
ISBN
3540486720

No coin nor oath required. For personal study only.

✦ Synopsis


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.

✦ Subjects


Computer Graphics


πŸ“œ SIMILAR VOLUMES


On treewidth approximations
✍ V BouchittΓ©; D Kratsch; H MΓΌller; I Todinca πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 279 KB

We introduce a natural heuristic for approximating the treewidth of graphs. We prove that this heuristic gives a constant factor approximation for the treewidth of graphs with bounded asteroidal number. Using a di erent technique, we give a O(log k) approximation algorithm for the treewidth of arbit

On treewidth approximations
✍ Vincent BouchittΓ©; Dieter Kratsch; Haiko Miiller; Ioan Todinca πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 329 KB
Treewidth computations I. Upper bounds
✍ Hans L. Bodlaender; Arie M.C.A. Koster πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 427 KB
Treewidth computations II. Lower bounds
✍ Hans L. Bodlaender; Arie M.C.A. Koster πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 335 KB