Two edge modification problems without polynomial kernels
- 31 August 2013
- journal article
- Published by Elsevier in Discrete Optimization
- Vol. 10 (3) , 193-199
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Kernel bounds for disjoint cycles and disjoint pathsTheoretical Computer Science, 2011
- On problems without polynomial kernelsJournal of Computer and System Sciences, 2009
- A more effective linear kernelization for cluster editingTheoretical Computer Science, 2009
- On Generating Triangle-Free GraphsElectronic Notes in Discrete Mathematics, 2009
- Two Edge Modification Problems without Polynomial Kernels2009
- Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs2007
- NP-completeness results for edge modification problemsDiscrete Applied Mathematics, 2006
- Complexity classification of some edge modification problemsDiscrete Applied Mathematics, 2001
- Fixed-parameter tractability of graph modification problems for hereditary propertiesInformation Processing Letters, 1996
- Some consequences of non-uniform conditions on uniform classesTheoretical Computer Science, 1983