Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/4102
Title: | An algorithm for ranking quickest simple paths | Authors: | Pascoal, Marta M. B. Captivo, M. Eugénia V. Clímaco, João C. N. |
Keywords: | Graph theory; Network; Quickest path; Simple path; Paths ranking | Issue Date: | 2005 | Citation: | Computers & Operations Research. 32:3 (2005) 509-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. | URI: | https://hdl.handle.net/10316/4102 | DOI: | 10.1016/S0305-0548(03)00250-8 | Rights: | openAccess |
Appears in Collections: | FEUC- Artigos em Revistas Internacionais FCTUC Eng.Informática - Artigos em Revistas Internacionais |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
file93575488f5ae462fb81c859da64d03dc.pdf | 278.22 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
63
checked on Sep 23, 2024
WEB OF SCIENCETM
Citations
57
checked on Sep 2, 2024
Page view(s) 50
587
checked on Oct 1, 2024
Download(s)
427
checked on Oct 1, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.