On the All-Pairs Shortest-Path Algorithm of Moffat and Takaoka

Random Structures and Algorithms

Volumn 10, Issue 1-2, 1997, Pages 205-220

  Mehlhorn, Kurt ^a   Priebe, Volker ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Lower bound; Probabilistic analysis; Shortest path problems; Tail estimates

Indexed keywords

EID: 0031538004     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(sici)1098-2418(199701/03)10:1/2<205::aid-rsa11>3.0.co;2-7     Document Type: Article

References (18)

1. 2 log n log* n), SIAM J. Comput., 12, 588-600 (1983).
2. E. W. Dijkstra, A note on two problems in connexion with graphs, Numer. Math., 1, 269-271 (1959).
3. D. Dubhashi, V. Priebe, and D. Ranjan, Negative dependence through the FKG inequality, Research Report MPI-I-96-1-020, Max-Planck-Institut für Informatik, Saarbrücken, August 1996.
4. R. W. Floyd, Algorithm 97: shortest path, Commun. ACM, 5, 345 (1962).
5. M. L. Fredman, New bounds on the complexity of the shortest path problem, SIAM J. Comput., 5, 83-89 (1976).
6. M. L. Fredman and R. E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, J. ACM, 34, 596-615 (1987).
7. A. M. Frieze and G. R. Grimmett, The shortest-path problem for graphs with random arc-lengths, Discrete Appl. Math., 10, 57-77 (1985).
8. W. Hoeffding, Probability inequalities for sums of bounded random variables, J. Am. Stat. Assoc., 58, 13-30 (1963).
9. M. Hofri, Analysis of Algorithms: Computational Methods and Mathematical Tools, Oxford University Press, Oxford, 1995.
10. D. R. Karger, D. Koller, and S. J. Phillips, Finding the hidden path: time bounds for all-pairs shortest paths, SIAM J. Comput., 22, 1199-1217 (1993).
11. C. McDiarmid, On the method of bounded differences, in Surveys in Combinatorics, 1989, (J. Siemons, Ed.), London Mathematical Society Lecture Note Series 141, Cambridge University Press, Cambridge, 1989, pp. 148-188.
12. K. Mehlhorn and V. Priebe, On the all-pairs shortest path algorithm of Moffat and Takaoka, in Algorithms - ESA '95 (P. Spirakis, Ed.), Lecture Notes in Computer Science 979, Springer-Verlag, Berlin, 1995, pp. 185-198.
13. 2 log n), Proc. 26th Annual Symposium on Foundations of Computer Science, Portland, OR, 1985, pp. 101-105.
14. 2 log n), SIAM J. Comput., 16, 1023-1031 (1987).
15. R. Raman, The power of collision: randomized parallel algorithms for chaining and integer sorting, in Foundations of Software Technology and Theoretical Computer Science, (K. V. Nori and C. E. Veni Madhavan, Eds.), Lecture Notes in Computer Science 472, Springer-Verlag, Berlin, 1990, pp. 161-175.
16. 2 n), SIAM J. Comput., 2, 28-32 (1973).
17. T. Takaoka, A new upper bound on the complexity of the all pairs shortest path problem, Inf. Process. Lett., 43, 195-199 (1992).
18. H. Thorisson, Coupling methods in probability theory, Scand. J. Stat., 22, 159-182 (1995).