11 search results - page 1 / 3 » A Cubic Kernel for Feedback Vertex Set |
103
click to vote
STACS
2007
Springer
15 years 3 months ago
2007
Springer
In this paper, it is shown that the Feedback Vertex Set problem on unweighted, undirected graphs has a kernel of cubic size. I.e., a polynomial time algorithm is described, that, w...
CIAC
2006
Springer
15 years 1 months ago
2006
Springer
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
FSTTCS
2009
Springer
15 years 4 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...
75
Voted
CORR
2010
Springer
14 years 6 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...
98
Voted
NETWORKS
2010
14 years 8 months ago
2010
We provide first-time fixed-parameter tractability results for the NP-complete problems Maximum Full-Degree Spanning Tree and Minimum-Vertex Feedback Edge Set. These problems are...