Treewidth, Tree Decompositions, and Brambles
Published Online: 15 FEB 2011
Copyright © 2010 John Wiley & Sons, Inc. All rights reserved.
Wiley Encyclopedia of Operations Research and Management Science
How to Cite
Koster, A. M. 2011. Treewidth, Tree Decompositions, and Brambles. Wiley Encyclopedia of Operations Research and Management Science. .
- Published Online: 15 FEB 2011
The notions of tree decomposition and treewidth play an important role in the design and analysis of algorithms for combinatorial optimization problems. The notion of a bramble can be used to find a lower bound on the treewidth of a graph. In this article we review the most important results for treewidth, tree decompositions, and brambles, both from a theoretical and practical point of view.
- tree decomposition;
- fixed parameter complexity;
- tree decomposition–based algorithm;