Abstract
We present an O(n3√log log n/ log n) time algorithm for the All Pairs Shortest Paths (APSP) problem for directed graphs with real edge lengths. This improves, by a factor of about √log n, previous algorithms for the problem obtained by Fredman, Takaoka and Dobosiewicz.
Original language | English |
---|---|
Pages (from-to) | 921-932 |
Number of pages | 12 |
Journal | Lecture Notes in Computer Science |
Volume | 3341 |
DOIs | |
State | Published - 2004 |