Parameterized complexity of Eulerian deletion problems

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

Volumn 6986 LNCS, Issue , 2011, Pages 131-142

  Cygan, Marek ^a   Marx, Dániel ^b   Pilipczuk, Marcin ^a   Pilipczuk, Michał ^a   Schlotter, Ildikó ^c  

^a UNIVERSITY OF WARSAW   (Poland)

^b HUMBOLDT UNIVERSITY   (Germany)

^c BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS; EULERIAN; FPT ALGORITHMS; PARAMETERIZED COMPLEXITY; UNDIRECTED GRAPH;

COMPUTER SCIENCE;

GRAPH THEORY;

EID: 84855375999     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-25870-1_13     Document Type: Conference Paper

References (31)

1. Ahuja, R.K., Goldberg, A.V., Orlin, J.B., Tarjan, R.E.: Finding minimum-cost flows by double scaling. Math. Program. 53, 243-266 (1992)
2. Alon, N., Shapira, A., Sudakov, B.: Additive approximation for edge-deletion problems. In: FOCS, pp. 419-428 (2005)
3. Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42(4), 844-856 (1995)
4. van Bevern, R., Moser, H., Niedermeier, R.: Approximation and tidying - a problem kernel for s-plex cluster vertex deletion. Algorithmica (February 2011)
5. Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Cross-composition: A new technique for kernelization lower bounds. CoRR abs/1011.4224 (2010)
6. Burzyn, P., Bonomo, F., Durán, G.: NP-completeness results for edge modification problems. Discrete Appl. Math. 154, 1824-1844 (2006)
7. Cai, J., Chakaravarthy, V.T., Hemaspaandra, L.A., Ogihara, M.: Competing provers yield improved Karp-Lipton collapse results. Inf. Comput. 198(1), 1-23 (2005)
8. Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Inf. Process. Lett. 58(4), 171-176 (1996)
9. Cai, L., Yang, B.: Parameterized Complexity of Even/Odd Subgraph Problems. In: Calamoneri, T., Diaz, J. (eds.) CIAC 2010. LNCS, vol. 6078, pp. 85-96. Springer, Heidelberg (2010)
10. Cechlárová, K., Schlotter, I.: Computing the Deficiency of Housing Markets with Duplicate Houses. In: Raman, V., Saurabh, S. (eds.) IPEC 2010. LNCS, vol. 6478, pp. 72-83. Springer, Heidelberg (2010)
11. 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(5), 1-19 (2008)
12. Díaz, J., Thilikos, D.M.: Fast FPT-Algorithms for Cleaning Grids. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 361-371. Springer, Heidelberg (2006)
13. Dorn, F., Moser, H., Niedermeier, R., Weller, M.: Efficient Algorithms for Eulerian Extension. In: Thilikos, D.M. (ed.)WG 2010. LNCS, vol. 6410, pp. 100-111. Springer, Heidelberg (2010)
14. Edmonds, J., Johnson, E.: Matching, Euler tours and the Chinese postman problem. Math. Program. 5, 88-124 (1973)
15. Garey, M.R., Johnson, D.S., Tarjan, R.E.: The planar Hamiltonian circuit problem is NP-complete. SIAM J. on Computing 5, 704-714 (1976)
16. Guo, J.: Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 915-926. Springer, Heidelberg (2007)
17. Khot, S., Raman, V.: Parameterized complexity of finding subgraphs with hereditary properties. Theor. Comput. Sci. 289, 997-1008 (2002)
18. Kolman, P., Pangrác, O.: On the complexity of paths avoiding forbidden pairs. Discrete Applied Mathematics 157(13), 2871-2876 (2009)
19. Kratsch, S.,Wahlström, M.: Two Edge Modification Problems Without Polynomial Kernels. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol. 5917, pp. 264-275. Springer, Heidelberg (2009)
20. Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is NP-complete. J. Comput. Syst. Sci. 20(2), 219-230 (1980)
21. Lokshtanov, D.: Wheel-Free Deletion is W[2]-Hard. In: Grohe, M., Niedermeier, R. (eds.) IWPEC 2008. LNCS, vol. 5018, pp. 141-147. Springer, Heidelberg (2008)
22. Marx, D.: Chordal deletion is fixed-parameter tractable. Algorithmica 57(4), 747-768 (2010)
23. Mathieson, L., Szeider, S.: The parameterized complexity of regular subgraph problems and generalizations. In: CATS, pp. 79-86 (2008)
24. Moser, H., Thilikos, D.M.: Parameterized complexity of finding regular induced subgraphs. Journal of Discrete Algorithms 7, 181-190 (2009)
25. Natanzon, A., Shamir, R., Sharan, R.: Complexity classification of some edge modification problems. Discrete Appl. Math. 113, 109-128 (2001)
26. Philip, G., Raman, V., Villanger, Y.: A Quartic Kernel for Pathwidth-one Vertex Deletion. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol. 6410, pp. 196-207. Springer, Heidelberg (2010)
27. Plesník, J.: The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two. Inf. Process. Lett. 8(4), 199-201 (1979)
28. Raman, V., Saurabh, S.: Parameterized algorithms for feedback set problems and their duals in tournaments. Theor. Comput. Sci. 351, 446-458 (2006)
29. Raman, V., Sikdar, S.: Parameterized complexity of the induced subgraph problem in directed graphs. Inf. Process. Lett. 104, 79-85 (2007)
30. Sorge, M.: On making directed graphs Eulerian. CoRR abs/1101.4283 (2011)
31. Yap, C.K.: Some consequences of non-uniform conditions on uniform classes. Theor. Comput. Sci. 26, 287-300 (1983)