I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths (Q3189063)
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: I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths |
scientific article; zbMATH DE number 6341934
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths |
scientific article; zbMATH DE number 6341934 |
Statements
I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths (English)
0 references
9 September 2014
0 references
graph algorithms
0 references
I/O-efficient algorithms
0 references
memory hierarchies
0 references
shortest path algorithms
0 references
0.9375234842300416
0 references
0.9346157908439636
0 references
0.825981080532074
0 references
0.8080796599388123
0 references
0.7903760671615601
0 references
