An algorithm for ranking quickest simple paths

Detalhes bibliográficos
Autor(a) principal: Pascoal, Marta M. B.
Data de Publicação: 2005
Outros Autores: Captivo, M. Eugénia V., Clímaco, João C. N.
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/10316/4102
https://doi.org/10.1016/S0305-0548(03)00250-8
Resumo: 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.
id RCAP_68cfcf7bac65fb1b0f0074d65a78f57c
oai_identifier_str oai:estudogeral.uc.pt:10316/4102
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling An algorithm for ranking quickest simple pathsGraph theoryNetworkQuickest pathSimple pathPaths rankingIn 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.http://www.sciencedirect.com/science/article/B6VC5-49H1010-2/1/2e3e3bf1d27b1f02e63aa36fe94594172005info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleaplication/PDFhttp://hdl.handle.net/10316/4102http://hdl.handle.net/10316/4102https://doi.org/10.1016/S0305-0548(03)00250-8engComputers & Operations Research. 32:3 (2005) 509-520Pascoal, Marta M. B.Captivo, M. Eugénia V.Clímaco, João C. N.info:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2020-11-06T16:59:48Zoai:estudogeral.uc.pt:10316/4102Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T20:58:17.392428Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv An algorithm for ranking quickest simple paths
title An algorithm for ranking quickest simple paths
spellingShingle An algorithm for ranking quickest simple paths
Pascoal, Marta M. B.
Graph theory
Network
Quickest path
Simple path
Paths ranking
title_short An algorithm for ranking quickest simple paths
title_full An algorithm for ranking quickest simple paths
title_fullStr An algorithm for ranking quickest simple paths
title_full_unstemmed An algorithm for ranking quickest simple paths
title_sort An algorithm for ranking quickest simple paths
author Pascoal, Marta M. B.
author_facet Pascoal, Marta M. B.
Captivo, M. Eugénia V.
Clímaco, João C. N.
author_role author
author2 Captivo, M. Eugénia V.
Clímaco, João C. N.
author2_role author
author
dc.contributor.author.fl_str_mv Pascoal, Marta M. B.
Captivo, M. Eugénia V.
Clímaco, João C. N.
dc.subject.por.fl_str_mv Graph theory
Network
Quickest path
Simple path
Paths ranking
topic Graph theory
Network
Quickest path
Simple path
Paths ranking
description 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.
publishDate 2005
dc.date.none.fl_str_mv 2005
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10316/4102
http://hdl.handle.net/10316/4102
https://doi.org/10.1016/S0305-0548(03)00250-8
url http://hdl.handle.net/10316/4102
https://doi.org/10.1016/S0305-0548(03)00250-8
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Computers & Operations Research. 32:3 (2005) 509-520
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv aplication/PDF
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799133873942036480

Registros relacionados