A 4k2 kernel for feedback vertex set

ACM Transactions on Algorithms

Volumn 6, Issue 2, 2010, Pages

  Thomassé, Stéphan ^a,b  

^a UNIV MONTPELLIER   (France)

^b LIRMM   (France)

Author keywords

Feedback vertex set; Fixed parameter tractability; Kernelization; Matching

Indexed keywords

FEEDBACK VERTEX SET; FIXED-PARAMETER TRACTABILITY; GRAPH G; KERNELIZATION; POLYNOMIAL-TIME; UNDIRECTED GRAPH;

POLYNOMIAL APPROXIMATION;

EID: 77950820874     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1721837.1721848     Document Type: Article

References (23)

1. BECKER, A., BAR-YEHUDA, R., AND GEIGER, D. 2000. Randomized algorithms for the loop cutset problem. J. Artif. Intell. Res. 12, 219-234.
2. BODLAENDER, H. L. 1994. On disjoint cycles. Int. J. Found. Comput. Sci. 5, 59-68.
3. BODLAENDER, H. L. 2007. A cubic kernel for feedback vertex set. In Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science (STACS'07). Lecture Notes in Computer Science, vol.4393. Springer, 320-331.
4. BODLAENDER, H. L., CAI, L., CHEN, J., FELLOWS, M. R., TELLE, J. A., AND MARX, D. 2006. Open problems in parameterized and exact computation. In Proceedings of the International Workshop on Parameterized and Exact Computation (IWPEC'06).
5. BODLAENDER, H. L., AND PENNINKX, E. 2008. A linear kernel for planar feedback vertex set. In Proceedings of the 3rd International Workshop on Parameterized and Exact Computation (IWPEC'08). Lecture Notes in Computer Science, vol.5018. Springer, 160-171.
6. BURRAGE, K., ESTIVILL-CASTRO, V., FELLOWS, M. R., LANGSTON, M. A., MAC, S., AND ROSAMOND, F. A. 2006. The undirected feedback vertex set problem has a poly(k) kernel. In Proceedings of the 2nd International Workshop on Parameterized and Exact Computation (IWPEC'06). Lecture Notes in Computer Science, vol.4169. Springer, 192-202.
7. CHEN, J., LIU, Y., LU, S., O'SULLIVAN, B., AND RAZGON, I. 2008. A fixed-parameter algorithm for the directed feedback vertex set problem. In Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC'08). ACM, 177-186.
8. DEHNE, F., FELLOWS, M., LANGSTON, M. A., ROSAMOND, F., AND STEVENS, K. 2005. An O(2O(k)n3) FPT algorithm for the undirected feedback vertex set problem. In Proceedings of the 11th Annual International Conference on Computing and Combinatorics (COCOON'05). Lecture Notes in Computer Science, vol.3595. Springer, 859-869.
9. DOWNEY, R. G., AND FELLOWS,M. R. 1992. Fixed-parameter tractability and completeness. Congressus Numer. 87, 161-187.
10. DOWNEY, R. G., AND FELLOWS, M. R. 1999. Parameterized Complexity. Springer.
11. EDMONDS, J. 1965. Paths, trees, and flowers. Canad. J. Math. 17, 449-467.
12. FLUM, J., AND GROHE, M. 2006. Parameterized Complexity Theory. Springer.
13. FOMIN, F. V., GASPERS, S., AND PYATKIN, A. V. 2006. Finding a minimum feedback vertex set in time O(1.7548n ). In Proceedings of the 2nd InternationalWorkshop onParameterized and Exact Computation (IWPEC'06). Lecture Notes in Computer Science, vol.4169. Springer, 184-191.
14. GALLAI, T. 1961. Maximum-Minimum sätze und verallgemeinerte faktoren von graphen. Acta. Math. Acad. Sci. Hungaricae 12, 131-173.
15. GUO, J., GRAMM, J., HÜFFNER, F., NIEDERMEIER, R., AND WERNICKE, S. 2005. Improved fixed- parameter algorithms for two feedback set problems. In Proceedings of the 9th International Workshop on Algorithms and Data Structures (WADS'05). Lecture Notes in Computer Science, vol.3608. Springer, 158-168.
16. KANJ, I. A., PELSMAJER, M. J., AND SCHAEFER, M. 2004. Parameterized algorithms for feedback vertex set. In Proceedings of the 1st International Workshop on Parameterized and Exact Computation (IWPEC'04). Lecture Notes in Computer Science, vol.3162. Springer, 235-247.
17. KRIESELL, M. 2005. Disjoint A-paths in digraphs. J. Comb. Theory, Ser. B 95, 1, 168-172.
18. MICALI, S., AND VAZIRANI, V. V. 1980. An O(|IV||E|) algorithm for finding maximum matching in general graphs. In Proceedings of the 21st Annual Symposium on Foundations of Computer Science (FOCS'80). IEEE Computer Society, 17-27.
19. NIEDERMEIER, R. 2006. Invitation to Fixed Parameter Algorithms. Oxford University Press.
20. RAMAN, V., SAURABH, S., AND SUBRAMANIAN, C. R. 2002. Faster fixed parameter tractable algorithms for undirected feedback vertex set. In Proceedings of the 13th International Symposium on Algorithms and Computation (ISAAC'02). Lecture Notes in Computer Science, vol.2518. Springer, 241-248.
21. RAMAN, V., SAURABH, S., AND SUBRAMANIAN, C. R. 2005. Faster algorithms for feedback vertex set. Electron. Not. Discr. Math. 19, 273-279.
22. RAZGON, I. 2006. Exact computation of maximum induced forest. In Proceedings of the 10th Scandinavian Workshop on Algorithm Theory (SWAT'06). Lecture Notes in Computer Science, vol.4059. Springer, 160-171.
23. SCHRIJVER, A. 2001. A short proof of Mader's S -paths theorem. J. Combin.Theory, Ser. B 82, 319-321.