48 search results - page 2 / 10 » Contraction and Treewidth Lower Bounds |
WEA
2005
Springer
13 years 10 months ago
2005
Springer
WG
2004
Springer
13 years 10 months ago
2004
Springer
ALGORITHMICA
2008
13 years 4 months ago
2008
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
MFCS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....