Packing Cycles Faster Than Erdos-Posa

DOI10.4230/LIPIcs.ICALP.2017.71zbMath1441.05210OpenAlexW2730043661MaRDI QIDQ5111402

Amer E. Mouawad, Saket Saurabh, Daniel Lokshtanov, Meirav Zehavi

Publication date: 27 May 2020

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/7385/pdf/LIPIcs-ICALP-2017-71.pdf/

zbMATH Keywords

graph algorithmsparameterized complexitycycle packingErdős-Pósa theorem

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Enumeration in graph theory (05C30) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (3)

Packing arc-disjoint cycles in tournaments ⋮ The parameterized complexity of cycle packing: indifference is not an issue ⋮ Packing Arc-Disjoint Cycles in Tournaments

This page was built for publication: Packing Cycles Faster Than Erdos-Posa