On r-Simple k-Path

DOI10.1007/978-3-662-44465-8_1zbMath1378.68124arXiv1312.4863OpenAlexW1898076938MaRDI QIDQ2922590

Ariel Gabizon, Nader H. Bshouty, Hasan Abasi, Elad Haramaty

Publication date: 14 October 2014

Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.4863

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Almost Optimal Cover-Free Families ⋮ Kernelization of Cycle Packing with Relaxed Disjointness Constraints ⋮ Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints ⋮ Tight Lower Bounds for the Complexity of Multicoloring ⋮ Detecting monomials with \(k\) distinct variables

This page was built for publication: On r-Simple k-Path