Discovering Treewidth

Abstract. Treewidth is a graph parameter with several interesting theoretical and practical applications. This survey reviews algorithmic results on determining the treewidth of a given graph, and finding a tree decomposition of small width. Both theoretical results, establishing the asymptotic computational complexity of the problem, as experimental work on heuristics (both for upper bounds as for lower bounds), preprocessing, exact algorithms, and postprocessing are discussed.

• Type: Conference
• Year: 2005
• Where: SOFSEM
• Authors: Hans L. Bodlaender
• Keywords: Asymptotic Computational Complexity, Graph Parameter, SOFSEM 2005, Theoretical Computer Science, Upper Bounds