Kernel for \(K_t\)\textsc{-free Edge Deletion}
From MaRDI portal
Publication:2656346
DOI10.1016/j.ipl.2020.106082OpenAlexW3117434375MaRDI QIDQ2656346
Publication date: 11 March 2021
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.03600
Related Items (2)
A survey of parameterized algorithms and the complexity of edge modification ⋮ Polynomial kernels for paw-free edge modification problems
Cites Work
- Unnamed Item
- Unnamed Item
- A \(2k\) kernel for the cluster editing problem
- Graph-based data clustering with overlaps
- Graph-modeled data clustering: Exact algorithms for clique generation
- A kernelization algorithm for \(d\)-hitting set
- Cluster editing: kernelization based on edge cuts
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
- Incompressibility of \(H\)-free edge modification problems
- On Generating Triangle-Free Graphs
- Intersection Theorems for Systems of Sets
- A Polynomial Kernel for Diamond-Free Editing
- Parameterized Lower Bound and Improved Kernel for Diamond-free Edge Deletion
- Polynomial kernels for paw-free edge modification problems
This page was built for publication: Kernel for \(K_t\)\textsc{-free Edge Deletion}
