Seonglae ChoBreaking the Sorting Barrier for Directed Single-Source Shortest Paths
We give a deterministic $O(m\log^{2/3}n)$-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition model. This is...
https://arxiv.org/abs/2504.17033
Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
New Method Is the Fastest Way To Find the Best Routes | Quanta Magazine
A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the classic algorithm taught in textbooks.
https://www.quantamagazine.org/new-method-is-the-fastest-way-to-find-the-best-routes-20250806/
