On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion}
type: Item
instance of: scholarly article
title: On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion}
zbMATH Open document ID: 1380.68211
author: N. R. Aravind
author: R. B. Sandeep
author: Naveen Sivadasan
published in: Algorithmica
publication date: 2017-11-09T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6804031
zbMATH Keywords: polynomial kernelization
zbMATH Keywords: edge deletion problems
zbMATH Keywords: bounded-degree graphs
MaRDI profile type: Publication
full work available at URL: s00453-016-0215-y
OpenAlex ID: W2786060560
cites work: Additive approximation for edge-deletion problems
cites work: Parameterized Lower Bounds and Dichotomy Results for the NP-completeness of H-free Edge Modification Problems
cites work: The complexity of some edge deletion problems
cites work: Characterizations of derived graphs
cites work: On generating triangle-free graphs
cites work: NP-completeness results for edge modification problems
cites work: Fixed-parameter tractability of graph modification problems for hereditary properties
cites work: Incompressibility of \(H\)-free edge modification problems
cites work: Some simplified NP-complete graph problems
cites work: Parameterized Algorithms
cites work: Polynomial Kernelization for Removing Induced Claws and Diamonds
cites work: Compressing Bounded Degree Graphs
cites work: A polynomial kernel for trivially perfect editing
cites work: Faster parameterized algorithms for deletion to split graphs
cites work: Graph-modeled data clustering: Exact algorithms for clique generation
cites work: On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
cites work: Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs
cites work: Finding a Maximum Cut of a Planar Graph in Polynomial Time
cites work: Cluster editing with locally bounded modifications
cites work: Two Edge Modification Problems without Polynomial Kernels
cites work: On stable cutsets in claw-free graphs and planar graphs
cites work: The node-deletion problem for hereditary properties is NP-complete
cites work: Q3866146
cites work: Some complexity results about threshold graphs
cites work: Bounded search tree algorithms for parametrized cograph deletion: efficient branching rules by exploiting structures of special graph classes
cites work: Complexity classification of some edge modification problems
cites work: The maximum edge biclique problem is NP-complete
cites work: Parameterized Lower Bound and Improved Kernel for Diamond-free Edge Deletion
cites work: Cluster graph modification problems
cites work: Computing the Minimum Fill-In is NP-Complete
cites work: Edge-Deletion Problems
DOI: 10.1007/S00453-016-0215-Y
description: scientific article; zbMATH DE number 6804031