Parameterized Lower Bound and NP-Completeness of Some H-Free Edge Deletion Problems
- 9 December 2015
- book chapter
- Published by Springer Nature
- p. 424-438
Abstract
No abstract availableKeywords
All Related Versions
This publication has 13 references indexed in Scilit:
- A Polynomial Kernel for Trivially Perfect Editing2015
- Incompressibility of $H$ H -Free Edge Modification ProblemsAlgorithmica, 2014
- Cluster editing with locally bounded modificationsDiscrete Applied Mathematics, 2012
- Graph-based data clustering with overlapsDiscrete Optimization, 2011
- Correlation ClusteringMachine Learning, 2004
- Which problems have strongly exponential complexity?2002
- On intervalizing k-colored graphs for DNA physical mappingDiscrete Applied Mathematics, 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
- The node-deletion problem for hereditary properties is NP-completeJournal of Computer and System Sciences, 1980