Discovering Treewidth [chapter]

Hans L. Bodlaender
2005 Lecture Notes in Computer Science  
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. * This is a revised version of a paper
doi:10.1007/978-3-540-30577-4_1 fatcat:p6qw6ze5jndr7mr7arggak5oo4