An algorithm for the ranking of shortest paths
JoséAugusto de Azevedo, Maria Emília O. Santos Costa, Joaquim João E.R. Silvestre Madeira, Ernesto Queirós Vieira Martins
Abstract
JoséAugusto de Azevedo, Maria Emília O. Santos Costa, Joaquim João E.R. Silvestre Madeira, Ernesto Queirós Vieira Martins
Abstract
An abstract is not available in the OpenAlex record for this paper.
OpenAlex reports 230 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Key concepts: K shortest path routing, Shortest path problem, Yen's algorithm, Shortest Path Faster Algorithm, Constrained Shortest Path First, Algorithm, Floyd–Warshall algorithm, Path (computing)