On the (non-)existence of polynomial kernels for Pl-free edge modification problems

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

Volumn 6478 LNCS, Issue , 2010, Pages 147-157

  Guillemot, Sylvain ^a   Paul, Christophe ^b   Perez, Anthony ^b  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^b LIRMM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CO-GRAPHS; COGRAPH; COMPLETION PROBLEM; EDGE MODIFICATION; EDGE-SETS; FINITE SET; FORBIDDEN INDUCED SUBGRAPHS; FORBIDDEN SUBGRAPHS; FREE EDGE; FREE GRAPHS; GRAPH CLASS; GRAPH G; GRAPH MODIFICATIONS; GRAPH PROPERTIES; HEREDITARY PROPERTY; LOWER BOUND TECHNIQUES; OPTIMIZATION PROBLEMS; PARAMETERIZED; PARAMETERIZED COMPLEXITY; POLYNOMIAL KERNELS; POLYNOMIAL SIZE;

POLYNOMIALS;

PARAMETERIZATION;

EID: 78650894729     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-17493-3_15     Document Type: Conference Paper

References (22)

1. Bodlaender, H., Downey, R., Fellows, M., Hermelin, D.: On problems without polynomial kernels. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 563-574. Springer, Heidelberg (2008)
2. Bodlaender, H.L., Thomassé, S., Yeo, A.: Kernel bounds for disjoint cycles and disjoint paths. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 635-646. Springer, Heidelberg (2009)
3. A. Brandstädt, V. B. Le, and J. P. Spinrad. Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications (1999)
4. Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Information Processing Letters 58(4), 171-176 (1996)
5. Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer, Heidelberg (1999)
6. El-Mallah, E.S., Colbourn, C.: The complexity of some edge deletion problems. IEEE Transactions on Circuits and Systems 35(3), 354-362 (1988)
7. Fellows, M.R., Langston, M., Rosamond, F., Shaw, P.: Efficient parameterized preprocessing for cluster editing. In: Csuhaj-Varjú, E., Ésik, Z. (eds.) FCT 2007. LNCS, vol. 4639, pp. 312-321. Springer, Heidelberg (2007)
8. Flum, J., Grohe, M.: Parameterized complexity theorey. Texts in Theoretical Computer Science. Springer, Heidelberg (2006)
9. Fortnow, L., Santhanam, R.: Infeasibility of instance compression and succinct PCPs for NP. In: STOC, pp. 133-142 (2008)
10. Garey, M., Johnson, S.: Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York (1978)
11. Golumbic, M., Kaplan, H., Shamir, R.: Graph sandwich problems. Journal of Algorithms 19, 449-473 (1995)
12. Habib, M., Paul, C.: A survey on algorithmic aspects of modular decomposition. Computer Science Review 4(1), 41-59 (2010)
13. Heggernes, P., Paul, C., Telle, J.A., Villanger, Y.: Interval completion with few edges. In: STOC, pp. 374-381 (2007)
14. Kenyon-Mathieu, C., Schudy, W.: How to rank with few errors. In: Annual ACM Symposium on Theory of Computing (STOC), pp. 95-103 (2007)
15. Kratsch, S., Wahlström, M.: Two edge modification problems without polynomial kernels. In: IWPEC 2009. LNCS, vol. 5917, pp. 264-275. Springer, Heidelberg (2009)
16. Natanzon, A., Shamir, R., Sharan, R.: Complexity classification of some edge modification problems. Discrete Applied Mathematics 113(1), 109-128 (2001) (Pubitemid 33732132)
17. Niedermeier, R.: Invitation to fixed parameter algorithms. Oxford Lectures Series in Mathematics and its Applications, vol. 31. Oxford University Press, Oxford (2006)
18. Niedermeier, R., Rossmanith, P.: A general method to speed up fixed-parametertractable algorithms. Information Processing Letters 73(3-4), 125-129 (2000) (Pubitemid 30560887)
19. Rose, D.J.: A graph-theoretic study of the numerical solution of sparse positive systems of linear equations. In: Graph Theory and Computing, pp. 183-217 (1972)
20. Shamir, R., Sharan, R., Tsur, D.: Cluster graph modification problems. Discrete Applied Mathematics 144(1-2), 173-182 (2004)
21. Tarjan, R., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM Journal of Computing 13, 566-579 (1984)
22. van Zuylen, A., Williamson, D.P.: Deterministic algorithms for rank aggragation and other ranking and clustering problems. In: Kaklamanis, C., Skutella, M. (eds.) WAOA 2007. LNCS, vol. 4927, pp. 260-273. Springer, Heidelberg (2008)