An improved Dijkstra's shortest path algorithm for sparse network (Q870157): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.amc.2006.06.094 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1979957675 / rank | |||
Normal rank | |||
Revision as of 23:53, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved Dijkstra's shortest path algorithm for sparse network |
scientific article |
Statements
An improved Dijkstra's shortest path algorithm for sparse network (English)
0 references
12 March 2007
0 references
Dijkstra's shortest path algorithm
0 references
comparison-addition model
0 references
Fibonacci heap
0 references
numerical examples
0 references
sparse networks
0 references
road traffic networks
0 references
