A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths.
Luca AllulliPeter LichodzijewskiNorbert ZehPublished in: SODA (2007)
Keyphrases
- undirected graph
- shortest path algorithm
- shortest path
- disjoint paths
- directed graph
- approximation algorithms
- minimum cost flow
- spanning tree
- minimum cost
- optimal solution
- connected components
- complex networks
- graph structure
- directed acyclic graph
- query processing
- positive integer
- vertex set
- prefetching
- weighted graph
- random graphs
- upper bound