Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor.
Aleksej Di SalvoGuido ProiettiPublished in: Theor. Comput. Sci. (2007)
Keyphrases
- shortest path
- path length
- weighted graph
- shortest path algorithm
- edge weights
- shortest path problem
- tree structure
- road network
- spanning tree
- edge detection
- routing algorithm
- index structure
- geodesic distance
- shortest distance
- flow graph
- minimal surface
- travel time
- r tree
- minimum cost flow
- strongly connected components
- optimal path
- state space
- social network analysis
- finding the shortest path