Parameterized complexity of deletion to scattered graph classes
From MaRDI portal
Publication:6089665
DOI10.4230/LIPICS.IPEC.2020.18zbMATH Open1529.68217MaRDI QIDQ6089665FDOQ6089665
Authors: Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman 
Publication date: 13 November 2023
Recommendations
- Deletion to scattered graph classes. I: Case of finite number of graph classes
- Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes
- Parameterized complexity of vertex deletion into perfect graph classes
- Parameterized complexity of vertex deletion into perfect graph classes
- FPT algorithms for FVS parameterized by split and cluster vertex deletion sets and other parameters
Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)
Cites Work
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Graph Classes: A Survey
- The node-deletion problem for hereditary properties is NP-complete
- Parameterized algorithms
- Parameterized graph separation problems
- Node-Deletion Problems on Bipartite Graphs
- An improved parameterized algorithm for the minimum node multiway cut problem
- Faster deterministic \textsc{Feedback Vertex Set}
- Intersection statements for systems of sets
- Parameterized complexity of vertex deletion into perfect graph classes
- Parameterized tractability of multiway cut with parity constraints
- Discovering archipelagos of tractability for constraint satisfaction and counting
- Wheel-Free Deletion Is W[2]-Hard
- A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion
- Bivariate complexity analysis of \textsc{Almost Forest Deletion}
- Generalized pseudoforest deletion: algorithms and uniform kernel
- An FPT algorithm for Tree Deletion Set
- Strong parameterized deletion: bipartite graphs
Cited In (6)
- Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes
- Faster FPT algorithms for deletion to pairs of graph classes
- Distance from triviality 2.0: hybrid parameterizations
- Deletion to scattered graph classes. I: Case of finite number of graph classes
- Single-exponential FPT algorithms for enumerating secluded \(\mathcal{F}\)-free subgraphs and deleting to scattered graph classes
- Title not available (Why is that?)
This page was built for publication: Parameterized complexity of deletion to scattered graph classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6089665)
