Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
An all pairs shortest path algorithm with expected time O(n2logn)
SIAM Journal on Computing
On the all-pairs shortest-path algorithm of Moffat and Takaoka
Random Structures & Algorithms - Special issue: average-case analysis of algorithms
An O(n² log log log n) Expected Time Algorithm for the all Shortest Distance Problem
MFCS '80 Proceedings of the 9th Symposium on Mathematical Foundations of Computer Science
A new approach to all-pairs shortest paths on real-weighted graphs
Theoretical Computer Science - Special issue on automata, languages and programming
More algorithms for all-pairs shortest paths in weighted graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
An O(n3 log log n/ log2 n) time algorithm for all pairs shortest paths
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
| Hi-index | 0.00 |
The best known expected time for the all pairs shortest path problem on a directed graph with non-negative edge costs is O(n 2logn) by Moffat and Takaoka. Let the solution set be the set of vertices to which the given algorithm has so far established shortest paths. The Moffat-Takaoka algorithm maintains complexities before and after the critical point in balance, which is the moment when the size of the solution set is n驴n/logn. In this paper, we remove the concept of critical point, whereby we make the algorithm simpler and seamless, resulting in a simpler analysis.