Dynamic Programming On Graphs With Bounded Treewidth (1987)
| Citations: | 41 - 0 self |
BibTeX
@MISC{Bodlaender87dynamicprogramming,
author = {Hans I. Bodlaender},
title = {Dynamic Programming On Graphs With Bounded Treewidth},
year = {1987}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we study the complexity of graph decision problems, restricted to the class of graphs with treewidth _< k, (or equivalently, the class of partial k-trees), for fixed k. We introduce two classes of graph decision problems, LCC and ECC, and subclasses C-LCC, and C-ECC. We show that each problem in LCC (or C-LCC) is solvable in polynomial (O(nc)) time, when restricted to graphs with fixed up- perbounds on the treewidth and degree; and that each problem in ECC (or C-ECC) is solvable in polynomial (O(nc)) time, when re- stricted to graphs with a fixed upperbound on the treewidth (with given corresponding tree-decomposition). Also, problems in C-LCC and C-ECC are solvable in polynomial time for graphs with a logarithmic treewidth, and given corresponding tree-decomposition, and in the case of C-LCC-problems, a fixed upperbound on the degree of the graph. Also, we show
