Reachability Diameter: Beyond the Square-Root Barrier, with Polynomial Hardness
cs.DS
Submitted: 2026-11-03
Updated: 2026-11-03
Terminology
Sources
- Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth
- Revisiting Diameter in Directed Graphs
- Folklore Sampling is Optimal for Exact Hopsets: Confirming the $\sqrt{n}$ Barrier
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