An All Pairs Shortest Path Algorithm with Expected Running Time O(n^2 log n)

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.

Authors

Alistair Moffat

This author has not been identified. Look up 'Alistair Moffat' in Google

Tadao Takaoka

This author has not been identified. Look up 'Tadao Takaoka' in Google