"All-pairs shortest paths in O(n2) time with high ..."

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