Preview
Unable to display preview. Download preview PDF.
References
A. V. Aho, J. E. Hopcroft and j. D. Ullman, "The Design and Analysis of Computer Algorithms", Addison-Wesley (1974).
P.A. Bloniarz, "A shortest path algorithm with expected time O(n2log n log*n), SIAM Jour. on Computing 12 (1983), pp. 588–600.
B.B. Dantzig, "On the shortest route through a network", Management Science 6 (1960), pp. 187–190.
E. D. Dekel, S. Nassimi and Sahni, "Parallel matrix and graph algorithms", SIAM Jour. on Computing 10 (1980).
E. W. Dijkstra, "A note on two problems in connection with graphs", Numer. Math. 1 (1959), pp. 269–271
R. W. Floyd, "Algorithm 97: shortest path", Comm. ACM 5 (1962), p345.
A. Frieze and L. Rudolph, "A parallel algorithm for all pairs shortest paths in a random graph", Technical Report, Dept. of Com. Sci., Carnegie-Mellon Univ. (1982).
Q. P. Gu and T. Takaoka, "On the average path length of O(log n) in the shortest path problem", Trans. of the IEICE of Japan E70 (1987) pp. 1155–1158.
Q. P. Gu and T. Takaoka, "A parallel algorithm for the all pairs shortest path problem", submitted for publication.
A. M. Moffat and T. Takaoka, "An all pairs shortest path algorithm with expected time O(n2log n)", SIAM Jour. on Computing 6 (1987), pp. 1023–1031.
J. Quinn and N. Deo, "Parallel graph algorithms", ACM Computing Surveys 16 (1984), pp. 319–348.
P. M. Spira, "A new algorithm for finding all shortest paths in a graph of positive arcs in average time O(n2log2n)", SIAM Jour. on Computing 2 (1973), pp. 28–32.
T. Takaoka and A. M. Moffat, "An O(n2log n loglog n) expected time algorithm for the all shortest distance problem", Lecture Notes in Computer Science 88, Springer (1980), pp. 642–655.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Takaoka, T. (1989). An efficient parallel algorithm for the all pairs shortest path problem. In: van Leeuwen, J. (eds) Graph-Theoretic Concepts in Computer Science. WG 1988. Lecture Notes in Computer Science, vol 344. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50728-0_51
Download citation
DOI: https://doi.org/10.1007/3-540-50728-0_51
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50728-4
Online ISBN: 978-3-540-46076-3
eBook Packages: Springer Book Archive