A Tourist Guide through Treewidth (1993) [138 citations — 22 self]
Download:
http://archive.cs.uu.nl/pub/RUU/CS/techreps/CS-199
http://www.cs.uu.nl/research/techreps/repo/CS-1992
DBLP
CACHED:
|
http://archive.cs.uu.nl/pub/RUU/CS/techreps/CS-199
http://www.cs.uu.nl/research/techreps/repo/CS-1992
DBLP
CACHED:
|
by
Hans L. Bodlaender
Acta Cybernetica
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@ARTICLE{Bodlaender93atourist,
author = {Hans L. Bodlaender},
title = {A Tourist Guide through Treewidth},
journal = {Acta Cybernetica},
year = {1993},
volume = {11},
pages = {1--23}
}
author = {Hans L. Bodlaender},
title = {A Tourist Guide through Treewidth},
journal = {Acta Cybernetica},
year = {1993},
volume = {11},
pages = {1--23}
}
Years of Citing Articles
Bookmarks
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.
