From Hop Reduction to Sparsification for Negative Length Shortest Paths

Kent Quanrud, Navid Tajkhorshid

The textbook algorithm for real-weighted single-source shortest paths takes $O(mn)$ time on a graph with $m$ edges and $n$ vertices. A recent breakthrough algorithm by [Fin24] take…