Please use this identifier to cite or link to this item:
DC FieldValueLanguage
dc.contributor.authorSantos, José Luis-
dc.identifier.citationPré-Publicações DMUC. 07-07 (2007)en_US
dc.description.abstractThis paper focuses on algorithms to solve the k-shortest path problem. Three codes are described and compared on random generated and real-world networks. One million paths were ranked in less than 3 seconds (3 microseconds per path), with at most 1 second of preprocessing, on random generated networks with 10 000 nodes. For real-world instances with more than one million nodes, the preprocessing time rises up to 2,7 hours and the CPU time to rank one million paths is less than 30 seconds (30 microseconds per path).en_US
dc.description.sponsorshipCentro de Matemática da Universidade de Coimbraen_US
dc.publisherCentro de Matemática da Universidade de Coimbraen_US
dc.subjectShortest pathen_US
dc.subjectRanking pathen_US
dc.subjectDeviation pathen_US
dc.titlek-Shortest path algorithmsen_US
item.fulltextCom Texto completo-
item.languageiso639-1en- of Sciences and Technology- of Coimbra- - Centre for Mathematics of the University of Coimbra-
Appears in Collections:FCTUC Matemática - Vários
Files in This Item:
File Description SizeFormat
k-Shortest path algorithms.pdf192.72 kBAdobe PDFView/Open
Show simple item record

Page view(s)

checked on Sep 15, 2022

Download(s) 50

checked on Sep 15, 2022

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.