A quadratic kernel for feedback vertex set

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 115-119

  Thomassé, Stéphan ^a  

^a UNIV MONTPELLIER   (France)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

FEEDBACK VERTEX SET; GRAPH G; POLYNOMIAL-TIME; QUADRATIC KERNELS; UNDIRECTED GRAPH;

GRAPH THEORY;

EID: 70349116018     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.13     Document Type: Conference Paper

References (21)

1. A. Becker, R. Bar-Yehuda, and D. Geiger, Randomized algorithms for the loop cutset problem, J. Artificial Intelligence Research, 12 (2000), pp. 219-234.
2. H. L. Bodlaender, On disjoint cycles, Int. J. Found. Computer Science, 5 (1994), pp. 59-68.
3. H.L. Bodlaender, A cubic kernel for feedback vertex set, in W. Thomas and P. Well (Eds.), Proceedings 24th International Symposium on Theoretical Aspects of Computer Science, STACS 2007, pp. 320-331. Springer, Lecture Notes in Computer Science.
4. H.L. Bodlaender and E. Penninkx, A Linear Kernel for Planar Feedback Vertex Set, IWPEC 2008, pp. 160-171.
5. H.L. Bodlaender, L. Cai, J. Chen, M.R. Fellows, J.A. Telle and D. Marx, Open problems in parameterized and exact computation, Technical Report UU-CS-2006-052, Utrecht University, 2006.
6. K. Burrage, V. Estivill-Castro, M. R. Fellows, M. A. Langston, S. Mac, and F. A. Rosamond, The undirected feedback vertex set problem has a poly(k) kernel, in H. L. Bodlaender and M. A. Langston, editors, Proceedings 2nd International Workshop on Parameterized and Exact Computation, IWPEC 2006, pp. 192-202. Springer Verlag, Lecture Notes in Computer Science, vol.4169, 2006.
7. J. Chen, Y. Liu, S. Lu, B. O'Sullivan and I. Razgon, A fixed-parameter algorithm for the directed feedback vertex set problem, STOC 2008, pp. 177-186.
8. 3) fpt algorithm for the undirected feedback vertex set problem, Theory Comput. Systems 41 (2007), pp. 479-492.
9. R. G. Downey and M. R. Fellows, Fixed-parameter tractability and completeness, Congressus Numerantium, 87 (1992), pp. 161-178.
10. R. G. Downey and M. R. Fellows, Parameterized Complexity. Springer, 1998.
11. J. Flum and M. Grohe, Parameterized Complexity Theory. Springer, 2006.
12. n), in H. L. Bodlaender and M. A. Langston, editors, Proceedings 2nd International Workshop on Parameterized and Exact Computation, IWPEC 2006, pp. 183-191. Springer Verlag, Lecture Notes in Computer Science, vol.4169, 2006.
13. T. Gallai, Maximum-minimum sätze und verallgemeinerte Faktoren von Graphen, Acta. Math. Acad. Sci. Hungaricae, 12 (1961), pp. 131-173.
14. J. Guo, J. Gramm, F. Huffner, R. Niedermeier, and S. Wernicke, Improved fixed parameter algorithms for two feedback set problems, in Proc. 9th Int. Workshop on Algorithms and Data Structures WADS 2004, pp. 158-168. Springer Verlag, Lecture Notes in Computer Science, vol.3608, 2004.
15. I. A. Kanj, M. J. Pelmajer, and M. Schaefer, Parameterized algorithms for feedback vertex set, in Proc. 1st Int. Workshop on Parameterized and Exact Computation, IWPEC 2004, pp. 235-248. Springer Verlag, Lecture Notes in Computer Science, vol.3162, 2004.
16. M. Kriesell, Disjoint A-paths in digraphs, J. Comb. Theory, Ser. B, 95 (2005), pp. 168-172.
17. R. Niedermeier, Invitation to fixed-parameter algorithms. Oxford University Press, 2006.
18. V. Raman, S. Saurabh, and C. R. Subramanian, Faster fixed parameter tractable algorithms for undirected feedback vertex set, in Proceedings 13th International Symposium on Algorithms and Computation, ISAAC 2002, pp. 241-248. Springer Verlag, Lecture Notes in Computer Science, vol.2518, 2002.
19. V. Raman, S. Saurabh, and C. R. Subramanian, Faster algorithms for feedback vertex set, in Proceedings 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics, GRACO 2005, Electronic Notes in Discrete Mathematics, 19 (2005), pp. 273-279.
20. I. Razgon, Exact computation of maximum induced forest, in L. Arge and R. Freivalds, editors, 10th Scandinavian Workshop on Algorithm Theory, SWAT 2006, pp. 160-171. Springer Verlag, Lecture Notes in Computer Science, vol.4059, 2006.
21. A. Schrijver, A short proof of Mader's S-paths theorem, J. Comb. Theory, Ser. B, 82 (2001), pp. 319-321.