Parameterized lower bound and improved kernel for diamond-free edge deletion
From MaRDI portal
Publication:5363789
Recommendations
Cited in
(14)- Edge deletion preserving the diameter of the hypercube
- Further parameterized algorithms for the \(\mathcal{F}\)-free edge deletion problem
- Kernel for \(K_t\)\textsc-free Edge Deletion
- Aspects of upper defensive alliances
- A Polynomial Kernel for Diamond-Free Editing
- scientific article; zbMATH DE number 7764101 (Why is no real title available?)
- Isolation of the diamond graph
- A survey of parameterized algorithms and the complexity of edge modification
- Polynomial kernels for paw-free edge modification problems
- On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion}
- Dichotomy results on the hardness of \(H\)-free edge modification problems
- A polynomial kernel for diamond-free editing
- Improved kernel and algorithm for claw and diamond free edge deletion based on refined observations
- Polynomial kernelization for removing induced claws and diamonds
This page was built for publication: Parameterized lower bound and improved kernel for diamond-free edge deletion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5363789)