Cache-oblivious buffer heap and cache-efficient computation of shortest paths in graphs (Q4554946)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6976501
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cache-oblivious buffer heap and cache-efficient computation of shortest paths in graphs |
scientific article; zbMATH DE number 6976501 |
Statements
Cache-Oblivious Buffer Heap and Cache-Efficient Computation of Shortest Paths in Graphs (English)
0 references
12 November 2018
0 references
cache-efficient
0 references
buffer heap
0 references
cache-oblivious
0 references
decrease-key
0 references
priority queue
0 references
shortest paths
0 references
0.8854544162750244
0 references
0.8565120697021484
0 references
0.8391713500022888
0 references
0.8308959603309631
0 references
