Compressing Bounded Degree Graphs
- 22 March 2016
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 362-375
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- A Polynomial Kernel for Trivially Perfect Editing2015
- Incompressibility of $H$ H -Free Edge Modification ProblemsAlgorithmica, 2014
- On the (Non-)Existence of Polynomial Kernels for P l -Free Edge Modification ProblemsAlgorithmica, 2012
- A kernelization algorithm for d-Hitting SetJournal of Computer and System Sciences, 2010
- Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs2007
- Efficient Parameterized Preprocessing for Cluster EditingLecture Notes in Computer Science, 2007
- NP-completeness results for edge modification problemsDiscrete Applied Mathematics, 2006
- Fixed-parameter tractability of graph modification problems for hereditary propertiesInformation Processing Letters, 1996
- The complexity of some edge deletion problemsIEEE Transactions on Circuits and Systems, 1988
- Intersection Theorems for Systems of SetsJournal of the London Mathematical Society, 1960