Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm (Q3439133): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:25, 4 February 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
