Achieving O(n:::3:::/log n) Time for All Pairs Shortest Paths by Using a Smaller Table

Yijie Han. Achieving O(n:::3:::/log n) Time for All Pairs Shortest Paths by Using a Smaller Table. In David Jeff Jackson, editor, 21st International Conference on Computers and Their Applications, CATA-2006, Seattle, Washington, USA, March 23-25, 2006, Proceedings. pages 36-37, ISCA, 2006.

Abstract

Abstract is missing.