I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths.
Ulrich MeyerNorbert ZehPublished in: ACM Trans. Algorithms (2012)
Keyphrases
- shortest path
- shortest path algorithm
- undirected graph
- minimum cost flow
- weighted graph
- edge weights
- shortest path problem
- strongly connected components
- road network
- directed graph
- connected components
- optimization problems
- data structure
- travel time
- combinatorial optimization
- random walk
- minimum spanning tree
- dynamic programming
- vertex set
- steiner tree
- social networks