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

DOI10.1145/3439721MaRDI QIDQ5028347zbMATH OpenOpenAlexFDO

Authors G. Gutin, Magnus Wahlström, Meirav Zehavi

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

Recommendations

• On \(r\)-simple \(k\)-path and related problems parameterized by \(k/r\)
• 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

Cited in

(1)

• On r-Simple k-Path

This page was built for publication: 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 Q5028347)