| Research>>> Acta Cybernetica>>> Previous Volumes>>> | Magyarul |
A Tourist Guide through Treewidth
H. L. Bodlaender
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.
Gyenizse Pal 1996. Szeptember 4. Szerda 13:28:54 MET DST