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

Research output: Contribution to journalArticlepeer-review

Abstract

We present an O(n3√log log n/logn)-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.

Original languageEnglish
Pages (from-to)181-192
Number of pages12
JournalAlgorithmica
Volume46
Issue number2
DOIs
StatePublished - Oct 2006

Keywords

  • Addition-comparison model
  • Bit-level parallelism
  • Decision trees
  • Min-plus Products
  • Shortest pasth

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