An O(n² log log log n) Expected Time Algorithm for the all Shortest Distance Problem.

Tadao Takaoka, Alistair Moffat

Browse the full MFCS paper archive.