Kernel bounds for disjoint cycles and disjoint paths

Theoretical Computer Science

Volumn 412, Issue 35, 2011, Pages 4570-4578

  Bodlaender, Hans L ^a   Thomassé, Stéphan ^b   Yeo, Anders ^c  

^a UTRECHT UNIVERSITY   (Netherlands)

^b LIRMM   (France)

^c UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Algorithms; Data reduction; Disjoint cycles; Fixed parameter complexity; Kernelization; Lower bounds

Indexed keywords

DISJOINT CYCLE; DISJOINT PATHS; FIXED PARAMETER COMPLEXITY; KERNELIZATION; LOWER BOUNDS; PACKING PROBLEMS; POLYNOMIAL KERNELS; POLYNOMIAL-TIME;

COMPUTATIONAL COMPLEXITY; MACHINERY; POLYNOMIAL APPROXIMATION;

DATA REDUCTION;

EID: 79960556512     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2011.04.039     Document Type: Article

References (29)

1. N. Alon, S. Hoory, and N. Linial The Moore bound for irregular graphs Graphs and Combinatorics 18 2002 53 57 (Pubitemid 36161499)
2. E. Amir Efficient approximation for triangulation of minimum treewidth J.S. Breese, D. Koller, Proceedings of the 17th Annual Conference on Uncertainty in Artificial Intelligence UAI 2001 2001 Morgan Kaufmann 7 15
3. E. Amir Approximation algorithms for treewidth Algorithmica 56 2010 448 479
4. H.L. Bodlaender A cubic kernel for feedback vertex set W. Thomas, P. Well, Proceedings 24th International Symposium on Theoretical Aspects of Computer Science STACS 2007 Lecture Notes in Computer Science vol. 4393 2007 Springer Verlag 320 331
5. H.L. Bodlaender Kernelization: New upper and lower bound techniques J. Chen, F.V. Fomin, Proceedings of the 4th International Workshop on Parameterized and Exact Computation IWPEC 2009 Lecture Notes in Computer Science vol. 5917 2009 Springer Verlag 17 37
6. H.L. Bodlaender, R.G. Downey, M.R. Fellows, and D. Hermelin On problems without polynomial kernels Journal of Computer and System Sciences 75 2009 423 434
7. H.L. Bodlaender, B.M.P. Jansen, and S. Kratsch Cross-composition: a new technique for kernelization lower bounds T. Schwentick, C. Drr, Proceedings 28th International Symposium on Theoretical Aspects of Computer Science STACS 2011 Leibniz International Proceedings in Informatics (LIPIcs) vol. 9 2011 Schloss DagstuhlLeibnitz-Zentrum fuer Informatik 165 176
8. H.L. Bodlaender, and E. Penninkx A linear kernel for planar feedback vertex set M. Grohe, R. Niedermeier, Proceedings of the 3rd International Workshop on Parameterized and Exact Computation IWPEC 2008 Lecture Notes in Computer Science vol. 5018 2008 Springer Verlag 160 171 (Pubitemid 351775568)
9. H.L. Bodlaender, E. Penninkx, and R.B. Tan A linear kernel for the k-disjoint cycle problem on planar graphs S.-H. Hong, H. Nagamochi, T. Fukunaga, Proceedings of the 19th International Symposium on Algorithms and Computation ISAAC 2008 Lecture Notes in Computer Science vol. 5369 2008 Springer Verlag 294 305
10. H.L. Bodlaender, and T.C. van Dijk A cubic kernel for feedback vertex set and loop cutset Theory of Computing Systems 46 2010 566 597
11. V. Bouchitté, D. Kratsch, H. Mller, and I. Todinca On treewidth approximations Discrete Applied Mathematics 136 2004 183 196
12. K. Burrage, V. Estivill-Castro, M.R. Fellows, M.A. Langston, S. Mac, and F.A. Rosamond The undirected feedback vertex set problem has a poly(k) kernel H.L. Bodlaender, M.A. Langston, Proceedings of the 2nd International Workshop on Parameterized and Exact Computation IWPEC 2006 Lecture Notes in Computer Science vol. 4169 2006 Springer Verlag 192 202 (Pubitemid 44609924)
13. Y. Chen, J. Flum, and M. Mller Lower bounds for kernelizations and other preprocessing procedures Theory of Computing Systems 48 4 2011
14. H. Dell, D. van Melkebeek, Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses, in: L.J. Schulman (Ed.), Proceedings of the 42nd Annual Symposium on Theory of Computing, STOC 2010, 2010, pp. 251260.
15. M. Dom, D. Lokshtanov, and S. Saurabh Incompressibility through colors and IDs S. Albers, A. Marchetti-Spaccamela, Y. Matias, S.E. Nikoletseas, W. Thomas, Proceedings of the 36th International Colloquium on Automata, Languages and Programming, ICALP 2009, Part I Lecture Notes in Computer Science vol. 5555 2009 Springer Verlag 378 389
16. R.G. Downey, and M.R. Fellows Fixed-parameter tractability and completeness I: basic results SIAM Journal on Computing 24 1995 873 921
17. R.G. Downey, and M.R. Fellows Fixed-parameter tractability and completeness II: on completeness for W [ 1 ] Theoretical Computer Science 141 1995 109 131
18. R.G. Downey, and M.R. Fellows Parameterized Complexity 1999 Springer
19. H. Fernau, F.V. Fomin, D. Lokshtanov, D. Raible, S. Saurabh, and Y. Villanger Kernel(s) for problems with no kernel: on out-trees with many leaves (extended abstract) S. Albers, J.-Y. Marion, Proceedings 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009 Dagstuhl Seminar Proceedings vol. 09001 2009 Schloss Dagstuhl Germany 421 432 Leibniz-Zentrum fr Informatik
20. L. Fortnow, and R. Santhanam Infeasibility of instance compression and succinct PCPs for NP Journal of Computer and System Sciences 77 2011 91 106
21. M.R. Garey, and D.S. Johnson Computers and Intractability, A Guide to the Theory of NP-Completeness 1979 W.H. Freeman and Company New York
22. J. Guo, and R. Niedermeier Invitation to data reduction and problem kernelization ACM SIGACT News 38 2007 31 45
23. R.M. Karp On the complexity of combinatorial problems Networks 5 1975 45 68
24. T. Kloks, C.M. Lee, and J. Liu New algorithms for k-face cover, k-feedback vertex set, and k-disjoint cycles on plane and planar graphs L. Kucera, Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science WG 2002 Lecture Notes in Computer Science vol. 2573 2002 Springer Verlag 282 295 (Pubitemid 36140607)
25. S. Kratsch, and M. Wahlström Two edge modification problems without polynomial kernels J. Chen, F.V. Fomin, Proceedings of the 4th International Workshop on Parameterized and Exact Computation IWPEC 2009 Lecture Notes in Computer Science vol. 5917 2009 Springer Verlag 264 275
26. L. Mathieson, E. Prieto, and P. Shaw Packing edge disjoint triangles: A parameterized view R.G. Downey, M.R. Fellows, Proceedings of the 1st International Workshop on Parameterized and Exact Computation IWPEC 2004 Lecture Notes in Computer Science vol. 3162 2004 Springer Verlag 127 137 (Pubitemid 39743995)
27. N. Robertson, and P.D. Seymour Graph minors. XIII. The disjoint paths problem Journal of Combinatorial Theory, Series B 63 1995 65 110
28. S. Saurabh, 2009. Personal communication.
29. k2 kernel for feedback vertex set ACM Transactions on Algorithms 6 2 2010