A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths.

Luca Allulli, Peter Lichodzijewski, Norbert Zeh

Browse the full SODA paper archive.