Two-level heaps: a new priority queue structure with applications to the single source shortest path problem (Q607658)
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: Two-level heaps: a new priority queue structure with applications to the single source shortest path problem |
scientific article; zbMATH DE number 5818347
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-level heaps: a new priority queue structure with applications to the single source shortest path problem |
scientific article; zbMATH DE number 5818347 |
Statements
Two-level heaps: a new priority queue structure with applications to the single source shortest path problem (English)
0 references
23 November 2010
0 references
single source shortest path
0 references
Dijkstra's algorithm
0 references
priority queues
0 references
two-level heaps
0 references
edge relaxation
0 references
0.9964151382446288
0 references
0.8320566415786743
0 references
0.8085981607437134
0 references
0.8048974275588989
0 references
