Abstract
In this paper, we propose an O(mn 2) time algorithm that finds all-pairs quickest paths in a given network N, where n and m are the numbers of nodes and arcs, respectively, in N. Besides, the quickest path between any two nodes can be determined in O(log m) time, provided O(mn 2) time preprocessing is made.
(Extended Abstract)
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Y. L. Chen and Y. H. Chin, "The quickest path problem," Computers and Operations Research, vol. 17, 1989, pp. 153–161.
Y. C. Hung and G. H. Chen, "On the quickest path problem," Tech. Rep., Department of Computer Science and Information Engineering, National Taiwan University, Taiwan, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hung, YC., Chen, GH. (1991). On the 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_152
Download citation
DOI: https://doi.org/10.1007/3-540-54029-6_152
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