On the Quickest Path Problem.
Journal
Inf. Process. Lett.
Journal Volume
46
Journal Issue
3
Pages
125-128
Date Issued
1993
Author(s)
Abstract
Let N be an input network and σ be the amount of data to be transmitted. We present an O(mn2) time algorithm that finds all-pairs quickest paths, for a given value of σ, and show that the quickest path between any two nodes for any value of σ can be found in O(log m) time, provided O(mn2) preprocessing time is spent. © 1993.
Type
journal article