Treewidth: Algorithmic Techniques and Results

Abstract This paper gives an overview of several results and techniques for graphs algorithms that compute the treewidth of a graph or that solve otherwise intractable problems when restricted graphs with bounded treewidth more efficiently. Also, several results on graph minors are reviewed.

Authors

• Hans L. Bodlaender

Keywords

No keywords are indexed for this paper.