32 search results - page 1 / 7 » Directed Feedback Vertex Set is Fixed-Parameter Tractable |
DAGSTUHL
2007
13 years 6 months ago
2007
CIAC
2006
Springer
13 years 8 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...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
WADS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Settling a ten years open question, we show that the NPcomplete Feedback Vertex Set problem is deterministically solvable in O(ck ·m) time, where m denotes the number of...
DAGSTUHL
2007
13 years 6 months ago
2007
To decide if the parameterized feedback vertex set problem in directed graph is fixed-parameter tractable is a long standing open problem. In this paper, we prove that the paramet...