A Cubic Kernel for Feedback Vertex Set
From MaRDI portal
Publication:3590945
DOI10.1007/978-3-540-70918-3_28zbMath1186.68217OpenAlexW2113924317MaRDI QIDQ3590945
Publication date: 3 September 2007
Published in: STACS 2007 (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/22185
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (19)
Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds ⋮ Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms ⋮ A Linear Kernel for Planar Feedback Vertex Set ⋮ Kernel bounds for disjoint cycles and disjoint paths ⋮ Lower bounds on kernelization ⋮ Subexponential parameterized algorithms ⋮ Confronting intractability via parameters ⋮ Exploring the Kernelization Borders for Hitting Cycles ⋮ On the parameterized complexity of reconfiguration problems ⋮ Parameterized graph cleaning problems ⋮ Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms ⋮ On the small cycle transversal of planar graphs ⋮ A Problem Kernelization for Graph Packing ⋮ A Quartic Kernel for Pathwidth-One Vertex Deletion ⋮ Hitting Forbidden Minors: Approximation and Kernelization ⋮ The complexity ecology of parameters: An illustration using bounded max leaf number ⋮ Iterative Compression for Exactly Solving NP-Hard Minimization Problems ⋮ On problems without polynomial kernels ⋮ Unnamed Item
This page was built for publication: A Cubic Kernel for Feedback Vertex Set
