Kernelization for feedback vertex set via elimination distance to a forest
From MaRDI portal
Publication:6039422
DOI10.1007/978-3-031-15914-5_12arXiv2206.04387OpenAlexW4313179894MaRDI QIDQ6039422
David Dekker, Bart M. P. Jansen
Publication date: 5 May 2023
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.04387
Cites Work
- Unnamed Item
- Unnamed Item
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter
- Fundamentals of parameterized complexity
- Sparsity. Graphs, structures, and algorithms
- Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization
- The complexity ecology of parameters: An illustration using bounded max leaf number
- A cubic kernel for feedback vertex set and loop cutset
- Polynomial kernels for hitting forbidden minors under structural parameterizations
- Polynomial kernels for vertex cover parameterized by small degree modulators
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?
- Fixed-parameter tractable distances to sparse graph classes
- Crown structures for vertex cover kernelization
- Crown reductions for the minimum weighted vertex cover problem
- Vertex Cover: Further Observations and Further Improvements
- The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel
- Vertex packings: Structural properties and algorithms
- Reducibility among Combinatorial Problems
- Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel
- Smaller Parameters for Vertex Cover Kernelization
- Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
- Graph-Theoretic Concepts in Computer Science
- Vertex deletion parameterized by elimination distance and even less
This page was built for publication: Kernelization for feedback vertex set via elimination distance to a forest
