A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths

Uri Zwick*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

32 Scopus citations

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.

Fingerprint

Dive into the research topics of 'A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths'. Together they form a unique fingerprint.

Cite this