Breaking the Sorting Barrier for Directed Single-Source Shortest Paths

Summary

[Submitted on 23 Apr 2025 (v1), last revised 30 Jul 2025 (this version, v2)] Title:Breaking the Sorting Barrier for Directed Single-Source Shortest Paths View a PDF of the paper titled Breaking the Sorting Barrier for Directed Single-Source Shortest Paths, by Ran Duan and 4 other authors View PDF HTML (experimental) Abstract: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 the first result to break the $O(m+n\log n)$ time bound of Dijkstra's algorithm on sparse graphs, showing that Dijkstra's algorithm is not optimal for SSSP. Submission history From: Ran Duan [view email] [v1] Wed, 23 Apr 2025 18:26:39 UTC (35 KB) [v2] Wed, 30 Jul 2025 11:02:48 UTC (49 KB)