On Polynomial Kernelization of $\mathcal {H}$-free Edge Deletion
Authors:
- 3 December 2014
- book chapter
- Published by Springer Nature
- p. 28-38
Abstract
No abstract availableKeywords
All Related Versions
This publication has 21 references indexed in Scilit:
- Fundamentals of Parameterized Complexity2013
- Incompressibility of H-Free Edge ModificationLecture Notes in Computer Science, 2013
- On the (Non-)Existence of Polynomial Kernels for P l -Free Edge Modification ProblemsAlgorithmica, 2012
- Additive approximation for edge-deletion problemsAnnals of Mathematics, 2009
- On Generating Triangle-Free GraphsElectronic Notes in Discrete Mathematics, 2009
- Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation2003
- Fixed-parameter tractability of graph modification problems for hereditary propertiesInformation Processing Letters, 1996
- Four Strikes Against Physical Mapping of DNAJournal of Computational Biology, 1995
- The complexity of some edge deletion problemsIEEE Transactions on Circuits and Systems, 1988
- Some simplified NP-complete problems1974