A Tourist Guide through Treewidth (1993)
by
Hans L. Bodlaender
| Venue: | Acta Cybernetica |
| Citations: | 167 - 21 self |
BibTeX
@ARTICLE{Bodlaender93atourist,
author = {Hans L. Bodlaender},
title = {A Tourist Guide through Treewidth},
journal = {Acta Cybernetica},
year = {1993},
volume = {11},
pages = {1--23}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A short overview is given of many recent results in algorithmic graph theory that deal with the notions treewidth, and pathwidth. We discuss algorithms that find tree-decompositions, algorithms that use tree-decompositions to solve hard problems efficiently, graph minor theory, and some applications. The paper contains an extensive bibliography.
Citations
No citations identified.
