Improved algorithm for all pairs shortest paths |
| |
| Authors: | Yijie Han |
| |
| Affiliation: | School of Computing and Engineering, University of Missouri at Kansas City, 5100 Rockhill Road, Kansas City, MO 64110, USA |
| |
| Abstract: | We present an improved algorithm for all pairs shortest paths. For a graph of n vertices our algorithm runs in O(n3(loglogn/logn)5/7) time. This improves the best previous result which runs in O(n3(loglogn/logn)1/2) time. |
| |
| Keywords: | Algorithms Complexity Graph algorithms Shortest path |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
