A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem.

Tadao Takaoka

Browse the full WG paper archive.