Feedback vertex set in mixed graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6844 LNCS, Issue , 2011, Pages 122-133

  Bonsma, Paul ^a   Lokshtanov, Daniel ^b  

^a HUMBOLDT UNIVERSITY   (Germany)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FEEDBACK VERTEX SET; FIXED PARAMETERS; MIXED GRAPH; TRACTABLE ALGORITHMS; UNDIRECTED GRAPH; FIXED-PARAMETER TRACTABLE ALGORITHMS;

ALGORITHMS; DATA STRUCTURES; DIRECTED GRAPHS;

GRAPH THEORY;

EID: 80052129733     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22300-6_11     Document Type: Conference Paper

References (26)

1. Bafna, V., Berman, P., Fujito, T.: A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM J. Discrete Math. 12, 289-297 (1999)
2. Becker, A., Geiger, D.: Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem. Artif. Intell. 83, 167-188 (1996)
3. Bodlaender, H.L.: On disjoint cycles. Int. J. Found. Comput. Sci. 5, 59-68 (1994)
4. Bodlaender, H.L., Fomin, F.V., Lokshtanov, D., Penninkx, E., Saurabh, S., Thilikos, D.M. (Meta) kernelization. In: FOCS 2009, pp. 629-638. IEEE, Los Alamitos (2009)
5. Cao, Y., Chen, J., Liu, Y.: On feedback vertex set new measure and new structures. In: Kaplan, H. (ed.) SWAT 2010. LNCS, vol. 6139, pp. 93-104. Springer, Heidelberg (2010)
6. Chen, J., Fomin, F., Liu, Y., Lu, S., Villanger, Y.: Improved algorithms for feedback vertex set problems. J. Comput. Syst. Sci. 74, 1188-1198 (2008)
7. Chen, J., Liu, Y., Lu, S., O'sullivan, B., Razgon, I.: A fixed-parameter algorithm for the directed feedback vertex set problem. J. ACM 55, 1-19 (2008)
8. 3) FPT algorithm for the undirected feedback vertex set problem. Theor. Comput. Syst. 41, 479-492 (2007)
9. Downey, R.G., Fellows,M.R.: Fixed-parameter tractability and completeness I: Basic results. SIAM J. Comput. 24, 873-921 (1995)
10. Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer, New York (1999)
11. Even, G., Naor, J., Schieber, B., Sudan, M.: Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica 20, 151-174 (1998)
12. Festa, P., Pardalos, P.M., Resende, M.: Feedback set problems. Handbook of Combinatorial Optimization A(Supplement), 209-258 (1999)
13. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006)
14. Fomin, F., Villanger, Y.: Finding induced subgraphs via minimal triangulations. In: STACS 2010. LIPIcs, vol. 5, pp. 383-394. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2010)
15. Fomin, F.V., Gaspers, S., Pyatkin, A.V., Razgon, I.: On the minimum feedback vertex set problem: Exact and enumeration algorithms. Algorithmica 52, 293-307 (2008)
16. Guo, J., Gramm, J., Hüffner, F., Niedermeier, R., Wernicke, S.: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. J. Comput. Syst. Sci. 72, 1386-1396 (2006)
17. Jain, K., Hajiaghayi, M., Talwar, K.: The generalized deadlock resolution problem. In: Caires, L., Italiano, G.F.,Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 853-865. Springer, Heidelberg (2005)
18. Kanj, I., Pelsmajer, M., Schaefer, M.: Parameterized algorithms for feedback vertex set. In: Downey, R.G., Fellows,M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 235-247. Springer, Heidelberg (2004)
19. Karp, R.: Reducibility among combinatorial problems. Complexity of Computer Computations, 85-103 (1972)
20. Mehlhorn, K.: Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness. Springer, Heidelberg (1984)
21. Niedermeier, R.: Invitation to fixed-parameter algorithms. Oxford University Press, Oxford (2006)
22. Raman, V., Saurabh, S., Subramanian, C.R.: Faster fixed parameter tractable algorithms for undirected feedback vertex set. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 241-248. Springer, Heidelberg (2002)
23. Raman, V., Saurabh, S., Subramanian, C.R.: Faster fixed parameter tractable algorithms for finding feedback vertex sets. ACM Trans. Algorithms 2, 403-415 (2006)
24. n). In: ICTCS, pp. 70-81 (2007)
25. Reed, B., Smith, K., Vetta, A.: Finding odd cycle transversals. Oper. Res. Lett. 32, 299-301 (2004)
26. 2 kernel for feedback vertex set. ACM Trans. Algorithms 6 (2010)