"All-Pairs Shortest Paths in O(n2) Time with High Probability."

Yuval Peres et al. (2010)
a service of Schloss Dagstuhl - Leibniz Center for Informatics