Parameterized lower bound and improved kernel for diamond-free edge deletion
From MaRDI portal
Publication:5363789
DOI10.4230/LIPICS.IPEC.2015.365zbMATH Open1378.68092OpenAlexW2253699097MaRDI QIDQ5363789FDOQ5363789
Authors: R. B. Sandeep, Naveen Sivadasan 
Publication date: 29 September 2017
Full work available at URL: http://dx.doi.org/10.4230/LIPIcs.IPEC.2015.365
Recommendations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
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
- Title not available (Why is that?)
- 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)
