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

DOI10.1137/1.9781611975482.105zbMath1432.68194OpenAlexW2951720074MaRDI QIDQ5236289

Magnus Wahlström, Gregory Gutin, Meirav Zehavi

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

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: On r-Simple k-Path and Related Problems Parameterized by k/r