On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem

preprint2016arXivOpen access

Abstract

The Shoshan-Zwick algorithm solves the all pairs shortest paths problem in undirected graphs with integer edge costs in the range {1,2,…,M}\{1, 2, \dots, M\}. It runs in O~(M⋅nω)\tilde{O}(M\cdot n^ω) time, where nn is the number of vertices, MM is the largest integer edge cost, and ω<2.3727ω< 2.3727 is the exponent of matrix multiplication. It is the fastest known algorithm for this problem. This paper points out the erroneous behavior of the Shoshan-Zwick algorithm and revises the algorithm to resolve the issues that cause this behavior. Moreover, it discusses implementation aspects of the Shoshan-Zwick algorithm using currently-existing sub-cubic matrix multiplication algorithms.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.