An O(m log D) algorithm for shortest paths (Q1145158)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(m log D) algorithm for shortest paths |
scientific article |
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
