Finding next-to-shortest paths in a graph (Q834912)
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: Finding next-to-shortest paths in a graph |
scientific article; zbMATH DE number 5599143
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding next-to-shortest paths in a graph |
scientific article; zbMATH DE number 5599143 |
Statements
Finding next-to-shortest paths in a graph (English)
0 references
27 August 2009
0 references
graph algorithms
0 references
computational complexity
0 references
shortest paths
0 references
0 references
0.9091455
0 references
0.90869313
0 references
0.90673447
0 references
0.9051076
0 references
0 references
0 references
0.89640665
0 references
