A simpler and more efficient algorithm for the next-to-shortest path problem (Q1939658): Difference between revisions
From MaRDI portal
Latest revision as of 06:31, 6 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A simpler and more efficient algorithm for the next-to-shortest path problem |
scientific article |
Statements
A simpler and more efficient algorithm for the next-to-shortest path problem (English)
0 references
5 March 2013
0 references
shortest path
0 references
time complexity
0 references
next-to-shortest path
0 references