The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm (Q1260623): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01299142 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2049802874 / rank | |||
Normal rank | |||
Latest revision as of 08:30, 30 July 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
0 references
