A note of an O(n:::3:::/logn) time algorithm for all pairs shortest paths

Yijie Han. A note of an O(n:::3:::/logn) time algorithm for all pairs shortest paths. Inf. Process. Lett., 105(3):114-116, 2008. [doi]

Abstract

Abstract is missing.