An O ( n 3(log log n /log n )5/4) Time Algorithm for All Pairs Shortest Path.
Autor: | Yijie Han |
---|---|
Předmět: | |
Zdroj: | Algorithmica; Aug2008, Vol. 51 Issue 4, p428-434, 7p |
Abstrakt: | Abstract We present an O(n 3(log log n/log n)5/4) time algorithm for all pairs shortest paths. This algorithm improves on the best previous result of O(n 3/log n) time. [ABSTRACT FROM AUTHOR] |
Databáze: | Complementary Index |
Externí odkaz: |