Treewidth: Characterizations, Applications, and Computations

This paper gives a short survey on algorithmic aspects of the treewidth of graphs. Some alternative characterizations and some applications of the notion are given. The paper also discusses algorithms to compute the treewidth of given graphs, and how these are based on the different characterization...

Full description

Saved in:
Bibliographic Details
Published inGraph-Theoretic Concepts in Computer Science pp. 1 - 14
Main Author Bodlaender, Hans L.
Format Book Chapter Conference Proceeding
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2006
Springer
SeriesLecture Notes in Computer Science
Subjects
Algorithmic Aspect
Applied sciences
Chordal Graph
Computer science; control theory; systems
Exact sciences and technology
Information retrieval. Graph
Input Graph
Linear Time Algorithm
Theoretical computing
Tree Decomposition
Algorithmics
Graph theory
Treewidth
Online AccessGet full text

Cover

More Information
Summary:This paper gives a short survey on algorithmic aspects of the treewidth of graphs. Some alternative characterizations and some applications of the notion are given. The paper also discusses algorithms to compute the treewidth of given graphs, and how these are based on the different characterizations, with an emphasis on algorithms that have been experimentally tested.
ISBN:9783540483816
3540483810
ISSN:0302-9743
1611-3349
DOI:10.1007/11917496_1