Alistair Moffat, Tadao Takaoka. An All Pairs Shortest Path Algorithm with Expected Running Time O(n^2 log n). In 26th Annual Symposium on Foundations of Computer Science, 21-23 October 1985, Portland, Oregon, USA. pages 101-105, IEEE, 1985.
@inproceedings{MoffatT85,
title = {An All Pairs Shortest Path Algorithm with Expected Running Time O(n^2 log n)},
author = {Alistair Moffat and Tadao Takaoka},
year = {1985},
researchr = {https://researchr.org/publication/MoffatT85},
cites = {0},
citedby = {0},
pages = {101-105},
booktitle = {26th Annual Symposium on Foundations of Computer Science, 21-23 October 1985, Portland, Oregon, USA},
publisher = {IEEE},
}