New parallel algorithms achieve Õ(m) work and o(√n) depth for reachability and shortest paths on directed graphs whenever m ≥ n^{1+o(1)}, improving on the prior Ω(√n) depth barrier.
Journal of Algorithms , volume=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth
New parallel algorithms achieve Õ(m) work and o(√n) depth for reachability and shortest paths on directed graphs whenever m ≥ n^{1+o(1)}, improving on the prior Ω(√n) depth barrier.