Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm (Q3439133): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.endm.2004.03.019 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.ENDM.2004.03.019 / rank | |||
Normal rank | |||
Latest revision as of 07:01, 21 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm |
scientific article |
Statements
Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm (English)
0 references
29 May 2007
0 references
