On the (Non-)Existence of Polynomial Kernels for P l -Free Edge Modification Problems
Top Cited Papers
- 21 February 2012
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 65 (4), 900-926
- https://doi.org/10.1007/s00453-012-9619-5
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- Kernel bounds for disjoint cycles and disjoint pathsTheoretical Computer Science, 2011
- Kernels for feedback arc set in tournamentsJournal of Computer and System Sciences, 2010
- Polynomial kernels for 3-leaf power graph modification problemsDiscrete Applied Mathematics, 2010
- A 2k Kernel for the Cluster Editing ProblemLecture Notes in Computer Science, 2010
- On problems without polynomial kernelsJournal of Computer and System Sciences, 2009
- On Generating Triangle-Free GraphsElectronic Notes in Discrete Mathematics, 2009
- Parameterized and Exact ComputationPublished by Springer Nature ,2006
- Graph Classes: A SurveyPublished by Society for Industrial & Applied Mathematics (SIAM) ,1999
- Fixed-parameter tractability of graph modification problems for hereditary propertiesInformation Processing Letters, 1996
- Handle-rewriting hypergraph grammarsJournal of Computer and System Sciences, 1993