Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm (Q3439133): 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 11:15, 5 March 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
