Linear-time kernelization for feedback vertex set
From MaRDI portal
Recommendations
Cited in
(30)- A randomized polynomial kernel for subset feedback vertex set
- Improved analysis of highest-degree branching for feedback vertex set
- Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies
- A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion
- Preprocessing to reduce the search space: antler structures for feedback vertex set
- Euler digraphs
- Linear Vertex-kernels for Several Dense Ranking r -Constraint Satisfaction Problems
- A parameterized complexity view on collapsing \(k\)-cores
- Computing kernels in parallel: lower and upper bounds
- Multi-budgeted directed cuts
- The PACE 2018 parameterized algorithms and computational experiments challenge: the third iteration
- Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds
- scientific article; zbMATH DE number 7286685 (Why is no real title available?)
- An improved FPT algorithm for independent feedback vertex set
- Kernelization for feedback vertex set via elimination distance to a forest
- Exact and parameterized algorithms for restricted subset feedback vertex set in chordal graphs
- Exact algorithms for restricted subset feedback vertex set in chordal and split graphs
- Kernelization for feedback vertex set via elimination distance to a forest
- Preprocessing to reduce the search space: antler structures for feedback vertex set
- Space-efficient graph kernelizations
- Kernelization for counting problems on graphs: preserving the number of minimum solutions
- Maintaining \(\mathrm{CMSO}_2\) properties on dynamic structures with bounded feedback vertex number
- Preprocessing complexity for some graph problems parameterized by structural parameters
- Cluster editing parameterized above modification-disjoint P₃-packings
- Cluster editing parameterized above modification-disjoint P₃-Packings
- Kernelization for counting problems on graphs: preserving the number of minimum solutions
- Breaking the barrier 2ᵏ for subset feedback vertex set in chordal graphs
- Solving subset feedback vertex set in chordal graphs faster than 2ᵏ
- Multi-budgeted directed cuts
- A parameterized complexity view on collapsing \(k\)-cores
This page was built for publication: Linear-time kernelization for feedback vertex set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111399)
