This survey gives an introduction to the class of bounded treewidth graphs, for which many NP-complete problems can be solved efficiently. The concept of a tree decomposition is explained. Subclasses of the bounded treewidth graphs are identified. Results about finding tree decompositions are summarized. Some problems which are efficiently solvable on… (More)

### Presentations referencing similar topics