The parameterized complexity of cycle packing: indifference is not an issue

DOI10.1007/978-3-319-77404-6_52zbMath1504.68175OpenAlexW2794233795MaRDI QIDQ5919415

Saket Saurabh, Meirav Zehavi, Abhishek Sahu, R. Krithika

Publication date: 12 February 2020

Published in: LATIN 2018: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-77404-6_52

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (2)

Kernelization of Arc Disjoint Cycle Packing in $$\alpha $$-Bounded Digraphs ⋮ Packing arc-disjoint cycles in tournaments

This page was built for publication: The parameterized complexity of cycle packing: indifference is not an issue