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

DOI10.1145/3439721OpenAlexW3123868149MaRDI QIDQ5028347

Meirav Zehavi, Magnus Wahlström, Gregory Gutin

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

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: r -Simple k -Path and Related Problems Parameterized by k / r