Two edge modification problems without polynomial kernels

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

Volumn 5917 LNCS, Issue , 2009, Pages 264-275

  Kratsch, Stefan ^a   Wahlström, Magnus ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

3SAT PROBLEM; EDGE MODIFICATION; FINITE SET; FORBIDDEN INDUCED SUBGRAPHS; FREE EDGE; GRAPH G; KERNELIZATION; LOWER BOUNDS; OPEN PROBLEMS; PARAMETERIZED; POLYNOMIAL KERNELS;

CONTROL THEORY; POLYNOMIALS; SET THEORY;

GRAPH THEORY;

EID: 72249089836     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11269-0_22     Document Type: Conference Paper

References (20)

1. Abu-Khzam, F.N.: Kernelization algorithms for d-hitting set problems. In: Dehne, et al. (eds.) [8], pp. 434-445
2. Bodlaender, H.L., Cai, L., Chen, J., Fellows, M.R., Telle, J.A., Marx, D.: IWPEC 2006. LNCS, vol. 4169. Springer, Heidelberg (2006)
3. Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels (extended abstract). 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)
4. 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)
5. Brügmann, D., Komusiewicz, C., Moser, H.: On generating triangle-free graphs. Electronic Notes in Discrete Mathematics 32, 51-58 (2009)
6. Burzyn, P., Bonomo, F., Durán, G.: NP-completeness results for edge modification problems. Discrete Applied Mathematics 154(13), 1824-1844 (2006)
7. Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Information Processing Letters 58(4), 171-176 (1996)
8. Dehne, F., Sack, J.-R., Zeh, N. (eds.): WADS 2007. LNCS, vol. 4619. Springer, Heidelberg (2007)
9. 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)
10. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, Heidelberg (1998)
11. Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2006)
12. Fortnow, L., Santhanam, R.: Infeasibility of instance compression and succinct PCPs for NP. In: STOC, pp. 133-142. ACM, New York (2008)
13. 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)
14. Guo, J.: A more effective linear kernelization for cluster editing. Theoretical Computer Science 410(8-10), 718-726 (2009)
15. Guo, J., Uhlmann, J.: Kernelization and complexity results for connectivity augmentation problems. In: Dehne, et al [8], pp. 483-494
16. Khanna, S., Sudan, M., Trevisan, L., Williamson, D.P.: The approximability of constraint satisfaction problems. SIAM Journal on Computing. 30(6), 1863-1920 (2000)
17. Natanzon, A., Shamir, R., Sharan, R.: Complexity classification of some edge modification problems. Discrete Applied Mathematics 113(1), 109-128 (2001)
18. Rose, D.J.: A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations. Graph Theory and Computing, pp. 183-217 (1972)
19. Sharan, R., Maron-Katz, A., Shamir, R.: CLICK and EXPANDER: a system for clustering and visualizing gene expression data. Bioinformatics 19(14), 1787-1799 (2003)
20. Yap, C.-K.: Some consequences of non-uniform conditions on uniform classes. Theoretical Computer Science 26, 287-300 (1983)