DMCA
An O(n 3 log log n / log n) Time Algorithm for the All-Pairs Shortest Path Problem (2004)
Cached
Download Links
by
Tadao Takaoka
| Citations: | 6 - 2 self |
BibTeX
@MISC{Takaoka04ano(n,
author = {Tadao Takaoka},
title = {An O(n 3 log log n / log n) Time Algorithm for the All-Pairs Shortest Path Problem},
year = {2004}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We design a faster algorithm for the all-pairs shortest path problem under the conventional RAM model, based on distance matrix multiplication (DMM). Specifically we improve the best known time complexity of O(n 3 (log log n) 2 / log n) to O(n 3 log log n / log n). As an application, we show the k-maximum subarray problem can be solved in O(kn 3 log log n/ log n) time for small k. 1
