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

DOI10.1007/s00453-019-00599-0zbMath1429.68195MaRDI QIDQ5919574

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

Publication date: 20 August 2019

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-019-00599-0

zbMATH Keywords

cycle packing; fixed-parameter tractable; proper interval deletion set

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C38: Paths and cycles

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

68Q27: Parameterized complexity, tractability and kernelization