Preprint
Sep 2026
A Faster Undirected Single-Source Shortest Path Algorithm
The single-source shortest paths (SSSP) problem in graphs with non-negative edge weights is one of the most classic problems in algorithms. For decades, the best known running time in the comparison-addition model was the $O(m+n\log n)$ bound of Dijkstra's algorithm with Fibonacci heaps. Recently, Duan, Mao, Shu, and Y...
Avi Kadria, L. Roditty
· 0 citations