The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm (Q1260623): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: Algorithm 360 / rank | |||
Normal rank |
Revision as of 03:01, 1 March 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