An improved Dijkstra's shortest path algorithm for sparse network (Q870157)
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: An improved Dijkstra's shortest path algorithm for sparse network |
scientific article; zbMATH DE number 5132913
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved Dijkstra's shortest path algorithm for sparse network |
scientific article; zbMATH DE number 5132913 |
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
0.8532920479774475
0 references
0.8223859667778015
0 references
0.8044497966766357
0 references
0.8003717660903931
0 references
