Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm (Q3439133)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm |
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
