A shortest-path algorithm with expected time O(n2 log n log* n)

Authors:
Peter Bloniarz
Affiliations:
-
Venue:
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Year:
1980

Citing 6
Cited 0

Finding the Lengths of All Shortest paths in N -Node Nonnegative-Distance Complete Networks Using 12N3 Additions and N3 Comparisons

Journal of the ACM (JACM)
Algorithm 97: Shortest path

Communications of the ACM
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Finding a minimum circuit in a graph

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Fast probabilistic algorithms for hamiltonian circuits and matchings

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Big Omicron and big Omega and big Theta

ACM SIGACT News

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an algorithm which finds the shortest distance between all pairs of points in a non-negatively weighted directed graph in the average time stated in the title. This algorithm, an extension of Spira's solution [Sp], executes in the stated time over quite general classes of probability distributions on graphs.