An O(m log D) algorithm for shortest paths (Q1145158)
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: An O(m log D) algorithm for shortest paths |
scientific article; zbMATH DE number 3695241
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(m log D) algorithm for shortest paths |
scientific article; zbMATH DE number 3695241 |
Statements
An O(m log D) algorithm for shortest paths (English)
0 references
1980
0 references
Dijkstra's shortest paths algorithm
0 references
binary counting tree
0 references
