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. 91-134 2003 48 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(03)00046-4 db/journals/jal/jal48.html#Meyer03