TY - JOUR
T1 - A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths
AU - Zwick, Uri
PY - 2004
Y1 - 2004
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=35048829333&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-30551-4_78
DO - 10.1007/978-3-540-30551-4_78
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:35048829333
VL - 3341
SP - 921
EP - 932
JO - Lecture Notes in Computer Science
JF - Lecture Notes in Computer Science
SN - 0302-9743
ER -