Structural Parameterizations of Feedback Vertex Set

DOI10.4230/LIPICS.IPEC.2016.21zbMath1390.68352OpenAlexW2591952371MaRDI QIDQ4634404

Diptapriyo Majumdar

Publication date: 10 April 2018

Full work available at URL: https://doi.org/10.4230/LIPIcs.IPEC.2016.21

zbMATH Keywords

feedback vertex setparameterized complexitykernelizationstructural parameterization

Mathematics Subject Classification ID

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) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Polynomial kernels for hitting forbidden minors under structural parameterizations ⋮ FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters ⋮ Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. ⋮ An approximation algorithm for the \(l\)-pseudoforest deletion problem

This page was built for publication: Structural Parameterizations of Feedback Vertex Set