A Cubic Kernel for Feedback Vertex Set
From MaRDI portal
Publication:3590945
DOI10.1007/978-3-540-70918-3_28zbMATH Open1186.68217OpenAlexW2113924317MaRDI QIDQ3590945FDOQ3590945
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
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cited In (21)
- A Linear Kernel for Planar Feedback Vertex Set
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems
- Parameterized graph cleaning problems
- Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms
- On problems without polynomial kernels
- Exploring the Kernelization Borders for Hitting Cycles
- On the small cycle transversal of planar graphs
- Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms
- Kernel bounds for disjoint cycles and disjoint paths
- On the parameterized complexity of reconfiguration problems
- Feedback vertex sets in cubic multigraphs
- Lower bounds on kernelization
- Subexponential parameterized algorithms
- Confronting intractability via parameters
- A Quartic Kernel for Pathwidth-One Vertex Deletion
- Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds
- A Problem Kernelization for Graph Packing
- A randomized polynomial kernel for subset feedback vertex set
- The complexity ecology of parameters: An illustration using bounded max leaf number
- Title not available (Why is that?)
- Hitting forbidden minors: approximation and kernelization
This page was built for publication: A Cubic Kernel for Feedback Vertex Set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3590945)
