A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs

DOI10.1007/978-3-540-92182-0_29zbMath1183.68412DBLPconf/isaac/BodlaenderPT08OpenAlexW1578674049WikidataQ59567710 ScholiaQ59567710MaRDI QIDQ3596728

Eelko Penninkx, Richard B. Tan, Hans L. Bodlaender

Publication date: 29 January 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92182-0_29

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Related Items (5)

A Retrospective on (Meta) Kernelization ⋮ A linear kernel for a planar connected dominating set ⋮ Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms ⋮ Bidimensionality and Kernels ⋮ Packing Cycles Faster Than Erdos--Posa

This page was built for publication: A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs