Polynomial kernels for paw-free edge modification problems
From MaRDI portal
Recommendations
- Two edge modification problems without polynomial kernels
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
- On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems
- Two edge modification problems without polynomial kernels
- Incompressibility of H-free edge modification
Cites work
- A Polynomial Kernel for Diamond-Free Editing
- Fixed-parameter tractability of graph modification problems for hereditary properties
- scientific article; zbMATH DE number 7764101 (Why is no real title available?)
- Kernel for \(K_t\)\textsc-free Edge Deletion
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
- Parameterized lower bound and improved kernel for diamond-free edge deletion
- Paw-free graphs
- The node-deletion problem for hereditary properties is NP-complete
Cited in
(11)- A polynomial kernel for diamond-free editing
- On subgraph complementation to \(H\)-free Graphs
- Polynomial kernelization for removing induced claws and diamonds
- On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems
- A Polynomial Kernel for Diamond-Free Editing
- Structural parameterization of cluster deletion
- A survey of parameterized algorithms and the complexity of edge modification
- Cutting a tree with subgraph complementation is hard, except for some small trees
- Polynomial Kernels for Paw-free Edge Modification Problems
- Cutting a tree with subgraph complementation is hard, except for some small trees
- A quadratic vertex kernel for diamond-free edge deletion
This page was built for publication: Polynomial kernels for paw-free edge modification problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5919117)
