An all pairs shortest path algorithm with expected running time O(n 2logn)

Authors:
Alistair Moffat;Tadao Takaoka
Affiliations:
-;-
Venue:
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Year:
1985

Citing 0
Cited 1

Minimizing time-space cost for database version control

Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

An algorithm is described that solves the all pairs shortest path problem for a nonnegatively weighted graph. The algorithm has an average requirement on quite general classes of random graphs of O(n2logn) time, where n is the number of vertices in the graph.