Directed Feedback Vertex Set is Fixed-Parameter Tractable

Dagstuhl Seminar Proceedings

Volumn 7281, Issue , 2007, Pages

  Razgon, Igor ^a   O'Sullivan, Barry ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

Directed Feedback Vertex Set; Fixed Parameter Tractability

Indexed keywords

DIRECTED FEEDBACK VERTEX SET; FEEDBACK VERTEX SET; FEEDBACK VERTEX SET PROBLEMS; FIXED-PARAMETER TRACTABILITY; PARAMETERIZED;

EID: 84864177406     PISSN: 18624405     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Dehne, F., Fellows, M., Langston, M., Rosamond, F., Stevens, K.: An O(2O(k)n 3 ) fpt algorithm for the undirected feedback vertex set problem. In: COCOON. (2005) 859-869
2. Guo, J., Niedermeier, R., Wernicke, S.: Parameterized complexity of generalized vertex cover problems. In: WADS. (2005) 36-48
3. Marx, D.: Chordal deletion is fixed-parameter tractable. In: 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2006). Volume 4271 of Lecture Notes in Computer Science., Berlin, Springer (2006) 37-48
4. Razgon, I.: Parameterized DFVS and multicut problems on DAGs. (In: ACiD 2007, to appear)
5. Chen, J., Lu, Y., Lu, S.: (An improved parameterized algorithm for the minimum node multiway cut problem)
6. Raman, V., Saurabh, S.: Parameterized algorithms for feedback set problems and their duals in tournaments. Theor. Comput. Sci. 351 (2006) 446-458
7. Dom, M., Guo, J., Hüffner, F., Niedermeier, R., Truß, A.: Fixed-parameter tractability results for feedback set problems in tournaments. In: CIAC. (2006) 320-331
8. Gutin, G., Yeo, A.: (Some parameterized problems on digraphs. available at http://www.cs.rhul.ac.uk/ gutin/pppublications.html)
9. Even, G., Naor, J., Schieber, B., Sudan, M.: Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica 20 (1998) 151-174
10. Marx, D.: Parameterized graph separation problems. Theoretical Computer Science 351 (2006) 394-406
11. Guo, J., Hüffner, F., Kenar, E., Niedermeier, R., Uhlmann, J.: Complexity and exact algorithms for multicut. In: SOFSEM. (2006) 303-312
12. Guo, J., Gramm, J., Hüffner, F., Niedermeier, R., Wernicke, S.: Improved fixedparameter algorithms for two feedback set problems. In: WADS. (2005) 158-168
13. Chen, J., Fomin, F., Liu, Y., Lu, S., Villanger, Y.: Improved algorithms for the feedback vertex set problems. (In: WADS 2007, to appear)
14. Burrage, K., Estivill-Castro, V., Fellows, M., Langston, M., Mac, S., Rosamond, F.: The undirected feedback vertex set problem has a poly() kernel. In: IWPEC. (2006) 192-202
15. Bodlaender, H.L.: A cubic kernel for feedback vertex set. In: STACS. (2007) 320-331
16. Razgon, I.: Exact Computation of Maximum Induced Forest. In: SWAT 2006, LNCS 4059. (2006) 160-171
17. Fomin, F., Gaspers, S., Pyatkin, A.: Finding a Minimum Feedback Vertex Set in time O(1.7548n ). In: IWPEC 2006. (2006) 184-191
18. Razgon, I.: Computing minimum directed feedback vertex set in O(1.9977n ). (In: ICTCS 2007, to appear