Advertisement

Algorithmica

, Volume 46, Issue 2, pp 181–192 | Cite as

A Slightly Improved Sub-Cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths

  • Uri Zwick
Article

Abstract

We present an \(O(n^3\sqrt{\log\log n}/\!\log n)\)-time algorithm for the All Pairs Shortest Paths (APSP) problem for directed graphs with real edge lengths. This slightly improves previous algorithms for the problem obtained by Fredman, Dobosiewicz, Han, and Takaoka.

Keywords

Short Path Transitive Closure Minimal Index Information Processing Letter Distance Product 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer 2006

Authors and Affiliations

  1. 1.Department of Computer Science, Tel Aviv University, Tel Aviv 69978Israel

Personalised recommendations