A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem (Q3066460)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem |
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
10 January 2011
0 references
algorithm
0 references
shortest path
0 references
time complexity
0 references
next-to-shortest path
0 references
0 references
0.93304306
0 references
0.91514814
0 references
0.9140741
0 references
0.9066236
0 references
0.9046924
0 references
0.89961034
0 references
0.8981943
0 references
