Kernelization for Cycle Transversal Problems
From MaRDI portal
Publication:3578384
DOI10.1007/978-3-642-14355-7_30zbMath1286.05074OpenAlexW1582791406MaRDI QIDQ3578384
Publication date: 20 July 2010
Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14355-7_30
Extremal problems in graph theory (05C35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
On the small cycle transversal of planar graphs ⋮ On the Small Cycle Transversal of Planar Graphs ⋮ New kernels for several problems on planar graphs
This page was built for publication: Kernelization for Cycle Transversal Problems