33 search results - page 5 / 7 » Feedback vertex set on AT-free graphs |
132
click to vote
MFCS
2004
Springer
15 years 7 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....
126
click to vote
MFCS
2009
Springer
15 years 8 months ago
2009
Springer
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
129
click to vote
FSTTCS
2009
Springer
15 years 8 months ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
106
click to vote
LATIN
2004
Springer
15 years 7 months ago
2004
Springer
For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...
112
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...