I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths (Q3189063)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths |
scientific article |
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
