On r-Simple k-Path and Related Problems Parameterized by k/r
DOI10.1137/1.9781611975482.105zbMath1432.68194MaRDI QIDQ5236289
Gregory Gutin, Meirav Zehavi, Magnus Wahlström
Publication date: 15 October 2019
Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611975482.105
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
