Reproduce “Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-Constrained Cycles” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Jovan Blanuša, Kubilay Atasu, Paolo Ienne
The paper extends fine-grained parallel algorithms for simple, temporal, and hop-constrained cycle enumeration by dynamically scheduling recursive search tasks across threads. This can reduce idle time when searches are uneven, while fine-grained Johnson may do redundant work. On tested workloads, the methods often outperform coarse-grained versions; temporal enumeration reaches 40× on one benchmark, not universally.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.