Treewidth: Algorithmic techniques and results (1998)
Cached
Download Links
by
Hans Bodlaender
| Venue: | In Mathematical foundations of computer science |
| Citations: | 113 - 10 self |
BibTeX
@INPROCEEDINGS{Bodlaender98treewidth:algorithmic,
author = {Hans Bodlaender},
title = {Treewidth: Algorithmic techniques and results},
booktitle = {In Mathematical foundations of computer science},
year = {1998},
pages = {pages},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper gives an overview of several results and techniques for graphs algorithms that compute the treewidth of a graph or that solve otherwise intractable problems when restricted graphs with bounded treewidth more efficiently. Also, several results on graph minors are reviewed.
