Improved algorithms for feedback vertex set problems

Journal of Computer and System Sciences

Volumn 74, Issue 7, 2008, Pages 1188-1198

  Chen, Jianer ^a   Fomin, Fedor V ^b   Liu, Yang ^a   Lu, Songjian ^a   Villanger, Yngve ^b  

^a TEXAS A AND M UNIVERSITY   (United States)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

Feedback vertex set; Parameterized complexity

Indexed keywords

GRAPH ALGORITHMS;

FEEDBACK VERTEX SET; FEEDBACK VERTEX SET PROBLEMS; GRAPH G; MINIMUM WEIGHT; PARAMETERIZED ALGORITHM; PARAMETERIZED COMPLEXITY; WEIGHTED GRAPH;

GRAPH THEORY;

EID: 52949098730     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2008.05.002     Document Type: Article

References (19)

1. Bafna V., Berman P., and Fujito T. A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM J. Discrete Math. 12 3 (1999) 289-297
2. Becker A., Bar-Yehuda R., and Geiger D. Randomized algorithms for the loop cutset problem. J. Artif. Intell. Res. (JAIR) 12 (2000) 219-234
3. Bodlaender H. On disjoint cycles. Internat. J. Found. Comput. Sci. 5 1 (1994) 59-68
4. J. Chen, Y. Liu, S. Lu, An improved parameterized algorithm for the minimum node multiway cut problem, Algorithmica (2008), in press
5. J. Chen, Y. Liu, S. Lu, B. O'Sullivan, I. Razgon, A fixed-parameter algorithm for the directed feedback vertex set problem, in: Proc. 40th ACM Symp. on Theory of Computing, 2008, pp. 177-186
6. Cormen T., Leiserson C., Rivest R., and Stein C. Introduction to Algorithms. second ed. (2001), MIT Press, McGraw-Hill Book Company
7. 3) fpt algorithm for the undirected feedback vertex set problem. COCOON. Lecture Notes in Comput. Sci. vol. 3595 (2005), Springer 859-869
8. Downey R., and Fellows M. Fixed parameter tractability and completeness. Complexity Theory: Current Research (1992), Cambridge University Press 191-225
9. Downey R., and Fellows M. Parameterized Complexit (1999), Springer, New York
10. Festa P., Pardalos P., and Resende M. Feedback set problems. Handbook of Combinatorial Optimization, Supplement vol. A (1999), Kluwer Acad. Publ., Dordrecht 209-258
11. n). IWPEC. Lecture Notes in Comput. Sci. vol. 4169 (2006), Springer 184-191
12. Guo J., Gramm J., Hüffner F., Niedermeier R., and Wernicke S. Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. J. Comput. System Sci. 72 8 (2006) 1386-1396
13. Kanj I., Pelsmajer M., and Schaefer M. Parameterized algorithms for feedback vertex set. IWPEC. Lecture Notes in Comput. Sci. vol. 3162 (2004), Springer 235-247
14. Karp R. Reducibility among combinatorial problems. Complexity of Computer Computations (1972), Plenum Press, New York 85-103
15. Raman V., Saurabh S., and Subramanian C. Faster fixed parameter tractable algorithms for finding feedback vertex sets. ACM Trans. Algorithms 2 3 (2006) 403-415
16. Raman V., Saurabh S., and Subramanian C. Faster fixed parameter tractable algorithms for undirected feedback vertex set. ISAAC 2002. Lecture Notes in Comput. Sci. vol. 2518 (2002), Springer 241-248
17. Razgon I. Exact computation of maximum induced forest. SWAT. Lecture Notes in Comput. Sci. vol. 4059 (2006), Springer 160-171
18. Reed B., Smith K., and Vetta A. Finding odd cycle transversals. Oper. Res. Lett. 32 4 (2004) 299-301
19. Silberschatz A., and Galvin P. Operating System Concepts. fourth ed. (1994), Addison-Wesley