Sub-Cubic Cost Algorithms for the All Pairs Shortest Path Problem

Tadao Takaoka. Sub-Cubic Cost Algorithms for the All Pairs Shortest Path Problem. In Manfred Nagl, editor, Graph-Theoretic Concepts in Computer Science, 21st International Workshop, WG 95, Aachen, Germany, June 20-22, 1995, Proceedings. Volume 1017 of Lecture Notes in Computer Science, pages 323-343, Springer, 1995.

Abstract

Abstract is missing.