Parameterized complexity of the \(\mathcal{T}_{h+1} \)-free edge deletion problem
From MaRDI portal
Publication:6546594
DOI10.1007/978-3-031-43587-4_16MaRDI QIDQ6546594
Publication date: 29 May 2024
Cites Work
- Unnamed Item
- Graph minors. III. Planar tree-width
- A unified approximation algorithm for node-deletion problems
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Deleting edges to restrict the size of an epidemic: a new application for treewidth
- On the NP-hardness of edge-deletion and -contraction problems
- Faster parameterized algorithms for deletion to split graphs
- The Complexity of Multiterminal Cuts
- On the hardness of approximating minimization problems
- Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs
- Node-and edge-deletion NP-complete problems
- Parameterized Algorithms
- Complexity classification of some edge modification problems
This page was built for publication: Parameterized complexity of the \(\mathcal{T}_{h+1} \)-free edge deletion problem
