Structural Parameterizations of Feedback Vertex Set
DOI10.4230/LIPICS.IPEC.2016.21zbMATH Open1390.68352OpenAlexW2591952371MaRDI QIDQ4634404FDOQ4634404
Authors: Diptapriyo Majumdar 
Publication date: 10 April 2018
Full work available at URL: https://doi.org/10.4230/LIPIcs.IPEC.2016.21
Recommendations
- Parameterized and Exact Computation
- On parameterized independent feedback vertex set
- On parameterized independent feedback vertex set
- Simultaneous feedback vertex set: a parameterized perspective
- Simultaneous feedback vertex set: a parameterized perspective
- Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization
- On feedback vertex set: new measure and new structures
- Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters
- On feedback vertex set new measure and new structures
- Feedback vertex set in mixed graphs
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cited In (8)
- Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization
- Kernelization for feedback vertex set via elimination distance to a forest
- On parameterized independent feedback vertex set
- Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations.
- Vertex cover structural parameterization revisited
- An approximation algorithm for the \(l\)-pseudoforest deletion problem
- FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters
- Polynomial kernels for hitting forbidden minors under structural parameterizations
This page was built for publication: Structural Parameterizations of Feedback Vertex Set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4634404)
