The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm (Q1260623): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:26, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm |
scientific article |
Statements
The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm (English)
0 references
30 August 1993
0 references
shortest-path algorithms
0 references
parallel algorithm
0 references
heuristics
0 references
