This is a preview of subscription content, log in via an institution.
References
Chen, Y.L. and Chin, Y.H., The Quickest Path Problem, Computers and Operations Research, Vol. 17 (1990), 153–161.
Deo, N. and Pang, C., Shortest Path Algorithms: Taxonomy and Annotation, Networks, Vol. 14(1984), 244–253.
Deo, N., Pang, C.Y. and Lord, R.E., Two Parallel Algorithms for Shortest Path Problems, Proceedings of ICPP(1980), 244–253.
Jenq, J. and Sahni, S., All Pairs Shortest Paths on a Hypercube Multiprocessor, Proceedings of ICPP(1987), 713–716.
Kumar, V. and Singh, V., Scalability of Parallel Algorithms for the All Pairs Shortest Path Problem: A Summary of Results, Proceedings of ICPP(1990), 136–140.
Paige, R.C. and Kruskal, C.P., Parallel Algorithms for Shortest Path Problems, Proceedings of ICPP(1985), 14–20.
Quinn, M.J. and Deo, N., Parallel Graph Algorithms, Computing Surveys, Vol. 16(1984), 319–348.
Rosen, J.B., Sun, S.-Z., Xue, G.-L., The Quickest Path Problem and the Enumeration of Quickest Paths, to appear in Computers and Operations Research.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rosen, J.B., Xue, GL. (1991). Sequential and distributed algorithms for the all pairs quickest path problem. In: Dehne, F., Fiala, F., Koczkodaj, W.W. (eds) Advances in Computing and Information — ICCI '91. ICCI 1991. Lecture Notes in Computer Science, vol 497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54029-6_196
Download citation
DOI: https://doi.org/10.1007/3-540-54029-6_196
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54029-8
Online ISBN: 978-3-540-47359-6
eBook Packages: Springer Book Archive