Lower and upper bounds of shortest paths in reachability graphs.
P. K. MishraPublished in: Int. J. Math. Math. Sci. (2004)
Keyphrases
- lower and upper bounds
- shortest path
- finding the shortest path
- weighted graph
- lower bound
- upper bound
- shortest path algorithm
- lagrangian relaxation
- strongly connected components
- shortest path problem
- edge weights
- road network
- betweenness centrality
- travel time
- flow graph
- graph partitioning
- graph model
- dynamic programming
- optimal path
- minimal surface
- minimum cost flow
- shortest distance
- branch and bound algorithm