An O(2O(k)n3) FPT algorithm for the undirected Feedback Vertex Set problem

Theory of Computing Systems

Volumn 41, Issue 3, 2007, Pages 479-492

  Dehne, Frank ^a   Fellows, Michael ^b   Langston, Michael ^c   Rosamond, Frances ^b   Stevens, Kim ^d  

^a CARLETON UNIVERSITY   (Canada)

^b UNIVERSITY OF NEWCASTLE   (Australia)

^c UNIVERSITY OF TENNESSEE   (United States)

^d Mechanics Institute   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED SEARCH; FEEDBACK VERTEX SET; FEEDBACK VERTEX SET PROBLEMS; FPT ALGORITHMS; PARAMETER FUNCTIONS; PARAMETERIZED; PARAMETERIZED COMPLEXITY; UNDIRECTED GRAPH;

ALGORITHMS;

ITERATIVE METHODS;

EID: 36849079763     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-007-1345-z     Document Type: Conference Paper

References (31)

1. J. Alber, H. L. Bodlaender, H. Fernau, T. Kloks and R. Niedermeier. Fixed parameter algorithms for Dominating Set and related problems on planar graphs. Algorithmica 33 (2002), 461-493.
2. F. N. Abu-Khzam, R. L. Collins, M. R. Fellows, M. A. Langston, W H. Suters and C. T. Symons. Kernelization algorithms for the vertex cover problem.: theory and experiments. Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX), New Orleans, January, 2004, pp. 62-69. ACM/SIAM, Proc. Applied Mathematics 115, L. Arge, G. Italiano and R. Sedgewick, eds.
3. H. Bodlaender. On disjoint cycles. International Journal of Foundations of Computer Science 5 (1994), 59-68.
4. V. Bafna, P. Berman and T. Fujito. A 2-approximation algorithm for the undirected feedback, vertex set problem. SIAM Journal on Discrete Mathematics 12 (1999), 289-297.
5. A. Becker, R. Bar-Yehuda and D. Geiger. Random algorithms for the loop cutset problem. Journal of Artificial Intelligence Research 12 (2000), 219-234.
6. R. Bar-Yehuda, D. Geiger, J. Naor and R. Roth. Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and Bayesian inference. SIAM Journal on Computing 27 (1998), 942-959.
7. Y. Chen and J. Flum. On miniaturized problems in parameterized complexity theory. Proceedings of the First International Workshop on Parameterized and Exact Computation, pp. 108-120. Lecture Notes in Computer Science, vol. 3.162. Springer-Verlag, Berlin, 2004.
8. 2) steps. Proceedings WG 2004, pp. 257-269. Lecture Notes in Computer Science, vol. 3353. Springer-Verlag, Berlin, 2004.
9. J. Chen, H. Fernau, I. Kanj and G. Xia. Parametric duality and kernelization: lower bounds and upper bounds on kernel size. Proceedings of the 22nd Symposium on Theoretical Aspects on Computer Science (STACS 2005), pp. 269-280. Lecture Notes in Computer Science, vol. 3404. Springer-Verlag, Berlin, 2005.
10. L. Cai and D. Juedes. On the existence of subexponential parameterized algorithms. Journal of Computer and System Sciences 67 (2003), 789-807.
11. R. Downey, V. Estivill-Castro, M. Fellows, E. Prieto-Rodriguez and F. Rosamond. Cutting up is hard to do: the complexity of k-cut and related problems. Electronic Notes in Theoretical ComputerScience 78 (2003), 205-218.
12. R. Downey and M. Fellows. Fixed-parameter tractability and completeness. Congressus Numerantium 87 (1992), 161-187.
13. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer-Verlag, New York, 1999.
14. F. Dehne, M. Fellows and F. Rosamond. An FPT algorithm for set splitting. Proceedings of the 29th Workshop on Graph Theoretic Concepts in Computer Science (WG 2003), pp. 180-191. Lecture Notes in Computer Science, vol. 2880. Springer-Verlag, Berlin, 2003.
15. F. Dehne, M. Fellows, F. Rosamond and P. Shaw. Greedy localization, iterative compression and modeled crown reductions: new FPT techniques, an improved algorithm for set splitting and a novel 2k kernelization for vertex cover. Proceedings of the First International Workshop on Parameterized and Exact Computation, pp. 271-280. Lecture Notes in Computer Science, vol. 3162. Springer-Verlag, Berlin, 2004.
16. G. Even, J. Naor, B. Scheiber and M. Sudan. Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica 20 (1998), 151-174.
17. C. Fried, W. Hordijk, S. J. Prohaska, C. R. Stadler and P. F. Stadler. The footprint sorting problem. Journal of Chemical Information and Computer Science 44 (2004), 332-338.
18. M. Fellows, M. Hallett and U. Stege. Analogs and duals of the MAST problem for sequences and trees. Journal of Algorithms 49 (2003), 192-216.
19. P. Festa, P. M. Pardalos and M. G. C. Resende. Feedback, set problems. In D. Z. Du, P. M. Pardalos (eds.), Handbook of Combinatorial Optimization, Vol. A, pp. 209-258. Kluwer, Dordrecht, 1999.
20. J. Guo, J. Gramm, F. Hueffner, R. Niedermeier and S. Wernicke. Improved fixed-parameter algorithms for two feedback set problems. Proceedings of WADS 2005, pp. 158-169. Lecture Notes in Computer Science, vol. 3608. Springer-Verlag, Berlin, 2005.
21. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NPCompleteness. Freeman, San Francisco, CA, 1979.
22. R. Impagliazzo, R. Paturi and F. Zane. Which problems have strongly exponential complexity? Journal of Computer and System Sciences 63 (2001), 512-530.
23. I. Kanj, M. Pelsmajer and M. Schaefer. Parameterized algorithms for feedback vertex set. Proceed-ings of the First International Workshop on Parameterized and Exact Computation, pp. 235-247. Lecture Notes in Computer Science, vol. 3162. Springer-Verlag, Berlin, 2004.
24. A. Kunzmann and H. Wunderlich. An analytical approach to the partial scan problem. Journal of Electronic Testing: Theory and Applications 1 (1990), 163-174.
25. D. Marx. Chordal deletion is fixed-parameter tractable. Manuscript, 2004.
26. R. Niedermeier. Invitation to Fixed-Parameter Algorithms. Habilitationschrift, University of Tubingen, 2002. (Electronic file available from R. Niedermeier.)
27. R. Niedermeier. Invitation to Fixed Parameter Algorithms. Oxford University Press, Oxford, 2006.
28. V. Raman, S. Saurabh and C. Subramanian. Faster fixed-parameter tractable algorithms for undi-rected feedback, vertex set. In Proceedings of the 13//» Annual International Symposium on Algo-rithms and Computation, pp. 241-248. Lecture Notes in Computer Science, vol. 2518. SpringerVerlag, Berlin, 2002.
29. V. Raman, S. Saurabh and CR. Subramanian. Faster algorithms for feedback vertex set. In Proceedings of the 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics, GRACO 2005, April 27-29, 2005, Angra dos Reis (Rio de Janeiro), Brazil. Electronic Notes in Discrete Mathematics. Elsevier, Amsterdam, 2005.
30. B. Reed, K. Smith, and A. Vetta. Finding odd cycle transversals. Operations Research Letters 32 (2004), 299-301.
31. G. J. Woeginger. Exact algorithms for NP-hard problems: a survey. Proceedings of 5th International Workshop on Combinatorial Optimization-Eureka, You Shrink'. Papers dedicated to Jack Edmonds, M. Junger, G. Reinelt, and G. Rinaldi (Festschrift eds.), pp. 184-207. Lecture Notes in Computer Science, vol. 2570. Springer-Verlag, Berlin, 2003.