Searching for "Achieving O(n3/log n) Time for All Pairs Shortest Paths by Using a Smaller Table." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB