Article ID Journal Published Year Pages File Type
4951332 Journal of Discrete Algorithms 2016 11 Pages PDF
Abstract
We present an O(n3log⁡log⁡n/log2⁡n) time algorithm for all pairs shortest paths. This algorithm improves on the best previous result of O(n3(log⁡log⁡n)3/log2⁡n) time.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
An O(n3log⁡log⁡n/log2⁡n) time algorithm for all pairs shortest paths
Authors
, ,