r -Simple k -Path and Related Problems Parameterized by k / r

DOI10.1145/3439721MaRDI QIDQ5028347

Gregory Gutin, Meirav Zehavi, Magnus Wahlström

Publication date: 8 February 2022

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.09108

zbMATH Keywords

parameterized complexity; \(p\)-set \((r, q)\)-packing; \(r\)-simple \(k\)-path

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.)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

68Q27: Parameterized complexity, tractability and kernelization