1 paper
Amr Elmasry
In this paper we give a single-source shortest-path algorithm that breaks, after over 65 years, the O(n⋅m) bound for the running time of the Bellman-Ford-Moore algorithm, w…