Finding next-to-shortest paths in a graph (Q834912): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:20, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding next-to-shortest paths in a graph |
scientific article |
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
