Faster parameterized algorithms for deletion to split graphs
From MaRDI portal
Publication:2904547
Recommendations
- Faster parameterized algorithms for deletion to split graphs
- Quadratic vertex kernel for split vertex deletion
- Quadratic vertex kernel for split vertex deletion
- \textsc{Split Vertex Deletion} meets \textsc{Vertex Cover}: new fixed-parameter and exact exponential-time algorithms
- Algorithms for deletion problems on split graphs
Cited in
(16)- Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs
- Vertex deletion on split graphs: beyond 4-hitting set
- \textsc{Split Vertex Deletion} meets \textsc{Vertex Cover}: new fixed-parameter and exact exponential-time algorithms
- Faster parameterized algorithm for pumpkin vertex deletion set
- Faster FPT algorithms for deletion to pairs of graph classes
- A simplified \(\widetilde{O}(nm)\) time edge-splitting algorithm in undirected graphs
- A simple \((2 + \epsilon)\)-approximation algorithm for split vertex deletion
- Deleting edges to restrict the size of an epidemic: a new application for treewidth
- Quadratic vertex kernel for split vertex deletion
- Deleting edges to restrict the size of an epidemic: a new application for treewidth
- Obtaining split graphs by edge contraction
- Parameterized algorithms for deletion to \((r,\ell)\)-graphs
- Faster parameterized algorithms for deletion to split graphs
- Polynomial kernelization for removing induced claws and diamonds
- Algorithms for deletion problems on split graphs
- Polynomial kernelization for removing induced claws and diamonds
This page was built for publication: Faster parameterized algorithms for deletion to split graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904547)