On r-simple k-path and related problems parameterized by k/r

DOI10.1137/1.9781611975482.105zbMATH Open1432.68194OpenAlexW2951720074MaRDI QIDQ5236289FDOQ5236289

Authors: G. Gutin, Magnus Wahlström, 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

Recommendations

• Fast algorithms for parameterized problems with relaxed disjointness constraints
• On r-Simple k-Path
• Faster Algebraic Algorithms for Path and Packing Problems
• Narrow sieves for parameterized paths and packings
• Algorithms – ESA 2004

Mathematics Subject Classification ID

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

Cited In (3)

• On r-Simple k-Path
• Fast algorithms for parameterized problems with relaxed disjointness constraints
• Faster Algebraic Algorithms for Path and Packing Problems

This page was built for publication: On \(r\)-simple \(k\)-path and related problems parameterized by \(k/r\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5236289)