23 search results - page 2 / 5 » Degree-Based Treewidth Lower Bounds |
ESA
2010
Springer
15 years 23 days ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
ESA
2004
Springer
15 years 5 months ago
2004
Springer
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
63
Voted
WG
2004
Springer
15 years 5 months ago
2004
Springer
ALGORITHMICA
2008
14 years 11 months ago
2008
114
click to vote
EJC
2008
14 years 11 months ago
2008
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...