New Bounds on the Complexity of the Shortest Path Problem

Michael L. Fredman. New Bounds on the Complexity of the Shortest Path Problem. SIAM Journal on Computing, 5(1):83-89, 1976.

Abstract

Abstract is missing.