Improved algorithm for finding next-to-shortest paths (Q845719): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Finding next-to-shortest paths in a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computing strictly-second shortest paths / rank | |||
Normal rank | |||
Latest revision as of 10:53, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved algorithm for finding next-to-shortest paths |
scientific article |
Statements
Improved algorithm for finding next-to-shortest paths (English)
0 references
29 January 2010
0 references
graph algorithms
0 references
computational complexity
0 references
shortest paths
0 references
