The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm (Q1260623)
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: The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm |
scientific article; zbMATH DE number 370412
| 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; zbMATH DE number 370412 |
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
0 references
