On the quickest path problem
In this paper, we propose an O(mn2) 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(mn2) time preprocessing is made.
Unable to display preview. Download preview PDF.
- 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.Google Scholar