Incompressibility of H-free edge modification problems: towards a dichotomy
From MaRDI portal
Publication:5874544
Recommendations
Cites work
- scientific article; zbMATH DE number 5485473 (Why is no real title available?)
- scientific article; zbMATH DE number 2011849 (Why is no real title available?)
- A Polynomial Kernel for Diamond-Free Editing
- Chordal editing is fixed-parameter tractable
- Cluster editing: kernelization based on edge cuts
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
- Dichotomy results on the hardness of \(H\)-free edge modification problems
- Edge-Deletion Problems
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Incompressibility of \(H\)-free edge modification problems
- Kernelization. Theory of parameterized preprocessing
- Node-Deletion Problems on Bipartite Graphs
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
- Parameterized algorithms
- Parameterized lower bounds and dichotomy results for the NP-completeness of \(H\)-free edge modification problems
- Polynomial kernelization for removing induced claws and diamonds
- The node-deletion problem for hereditary properties is NP-complete
Cited in
(2)
This page was built for publication: Incompressibility of \(H\)-free edge modification problems: towards a dichotomy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874544)
