An O(2O(k)n3) FPT algorithm for the undirected feedback vertex set problem

Lecture Notes in Computer Science

Volumn 3595, Issue , 2005, Pages 859-869

  Dehne, Frank ^a   Fellows, Michael ^b   Langston, Michael A ^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

COMPUTER SCIENCE; GRAPH THEORY; PROBLEM SOLVING; SET THEORY; COMBINATORIAL MATHEMATICS; ITERATIVE METHODS; PARAMETER ESTIMATION;

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

ALGORITHMS;

EID: 26844469337     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11533719_87     Document Type: Conference Paper

References (28)

1. [ABFKN02] 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. [ACFLSS04] 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, ACM/SIAM, Proc. Applied Mathematics 115, L. Arge, G. Italiano and R. Sedgewick, eds.
3. [BBF99] 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.
4. [BBG00] A. Becker, R. Bar-Yehuda and D. Geiger. Random algorithms for the loop cutset problem. Journal of Artificial Intelligence Research 12 (2000), 219-234.
5. [BGNR98] 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.
6. [Bod94] H. Bodlaender. On disjoint cycles. International Journal of Foundations of Computer Science 5 (1994), 59-68.
7. [CF04] Y. Chen and J. Flum. On miniaturized problems in parameterized complexity theory. Proceedings of the First International Workshop on Parameterized and Exact Computation, Springer-Verlag, Lecture Notes in Computer Science vol. 3162 (2004), 108-120.
8. [CJ03] L. Cai and D. Juedes. On the existence of subexponential parameterized algorithms. Journal of Computer and System Sciences 67 (2003), 789-807.
9. [CFKX05] J. Chen, H. Fernau, I. Kanj and G. Xia. Parametric duality and kernelization: lower bounds and upper bounds on kernel size. The 22nd Symposium on Theoretical Aspects on Computer Science (STACS 2005), Springer-Verlag, Lecture Notes in Computer Science vol. 3404 (2005), 269-280.
10. [DEFPR03] 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 Computer Science 78 (2003), 205-218.
11. [DF92] R. Downey and M. Fellows. Fixed-parameter tractability and completeness. Congressus Numerantium 87 (1992), 161-187.
12. [DF99] R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer-Verlag, 1999.
13. [DFR03] 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), Springer-Verlag, Lecture Notes in Computer Science 2880 (2003), 180-191.
14. [DFRS04] 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, Springer-Verlag, Lecture Notes in Computer Science vol. 3162 (2004), 271-280.
15. [ENSS98] G. Even, J. Naor, B. Scheiber and M. Sudan. Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica 20 (1998), 151-174.
16. [FHPSS04] C. Fried, W. Hordijk, S.J. Prohaska, C.R. Stadler and P.F. Stadler. The footprint sorting problem. J. Chem. Inf. Comput. Sci. 44 (2004), 332 -338.
17. [FHS03] 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.
18. [GGHNW05] J. Guo, J. Gramm, F. Hueffner, R. Niedermeier, S. Wernicke. Improved fixed-parameter algorithms for two feedback set problems. Proceedings of WADS 2005, Springer-Verlag, Lecture Notes in Computer Science (2005), to appear.
19. [GJ79] M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
20. [KPS04] I. Kanj, M. Pelsmajer and M. Schaefer. Parameterized algorithms for feedback vertex set. Proceedings of the First International Workshop on Parameterized and Exact Computation, Springer-Verlag, Lecture Notes in Computer Science vol. 3162 (2004), 235-247.
21. [KW90] A. Kunzmann and H. Wunderlich. An analytical approach to the partial scan problem. Journal of Electronic Testing: Theory and Applications 1 (1990), 163-174.
22. [Ma04] D. Marx. Chordal deletion is fixed-parameter tractable. Manuscript, 2004.
23. [Nie02] R. Niedermeier. Invitation to fixed-parameter algorithms, Habilitationschrift, University of Tubingen, 2002. (Electronic file available from R. Niedermeier.)
24. [Nie05] R. Niedermeier. Invitation to Fixed-Parameter Algorithms, Oxford University Press, forthcoming.
25. [RSS02] V. Raman, S. Saurabh and C. Subramanian. Faster fixed-parameter tractable algorithms for undirected feedback vertex set. In Proceedings of the 13th Annual International Symposium on Algorithms and Computation, Springer, Lecture Notes in Computer Science vol. 2518 (2002), 241-248.
26. [RSS05] V. Raman, S. Saurabh and C.R. 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. Elsevier, Electronic Notes in Discrete Mathematics (2005), to appear.
27. [RSV04] B. Reed, K. Smith, and A. Vetta. Finding odd cycle transversals. Operations Research Letters 32 (2004), 299-301.
28. [Woe03] 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.) Springer-Verlag, Lecture Notes in Computer Science 2570 (2003), 184-207.