Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds.
Ulrich MeyerPublished in: J. Algorithms (2003)
Keyphrases
- lower and upper bounds
- shortest path
- shortest path problem
- single source
- shortest path algorithm
- upper and lower bounds
- lower bound
- minimum cost flow
- upper bound
- data structure
- learning algorithm
- optimization problems
- average case complexity
- road network
- random walk
- markov chain
- worst case
- computational complexity
- data streams