Finding next-to-shortest paths in a graph (Q834912): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1985676638 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4500916 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding the k Shortest Paths / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computing strictly-second shortest paths / rank | |||
Normal rank | |||
Latest revision as of 22:38, 1 July 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
