Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds

Ulrich Meyer. Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds. J. Algorithms, 48(1):91-134, 2003. [doi]

Abstract

Abstract is missing.