Sciweavers

SIAMCOMP
2008
65views more  SIAMCOMP 2008»
13 years 11 months ago
Exact Algorithms for Treewidth and Minimum Fill-In
We show that the treewidth and the minimum fill-in of an n-vertex graph can be
Fedor V. Fomin, Dieter Kratsch, Ioan Todinca, Yngv...
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
13 years 11 months ago
Approximation Algorithms for Treewidth
Abstract. This paper presents algorithms whose input is an undirected graph, and whose output is a tree decomposition of width that approximates the optimal, the treewidth of that ...
Eyal Amir
FOCS
2007
IEEE
14 years 5 months ago
Can you beat treewidth?
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
Dániel Marx