Title of article
An algorithm for ranking quickest simple paths
Author/Authors
Marta M. B. Pascoal، نويسنده , , M. Eugénia V. Captivo، نويسنده , , Jo?o C. N. Cl?maco، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2005
Pages
12
From page
509
To page
520
Abstract
In this paper, an algorithm for ranking loopless paths in undirected networks, according to the transmission time, is presented. It is shown that the worst-case computational time complexity of the algorithm presented is , which is also the best-known complexity to solve this problem. The worst-case memory complexity is , which improves the existing algorithms. Finally, comparative computational results, with other algorithms for the same problem, are reported.
Keywords
Quickest path , Simple path , Paths ranking , Graph theory , Network
Journal title
Computers and Operations Research
Serial Year
2005
Journal title
Computers and Operations Research
Record number
928180
Link To Document