Semi-Streaming Reachability and Shortest Paths in n 1/3+o(1) Passes
cs.DS
Submitted: 2026-11-03
Updated: 2026-11-03
Code: https://github.com/garytho/semi-streaming-directed-shortest-paths
Terminology
Sources
- Streaming Algorithms for Monotonicity Testing
- Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time