Tadao Takaoka. A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem. In Gunther Schmidt, Rudolf Berghammer, editors, 17th International Workshop, WG 91, Fischbachau, Germany, June 17-19, 1991, Proceedings. Volume 570 of Lecture Notes in Computer Science, pages 209-213, Springer, 1991.
Abstract is missing.