Point-of-Failure Shortest-Path Rerouting: Computing the Optimal Swap Edges Distributively.
Paola FlocchiniAntonio Mesa EnriquesLinda PagliGiuseppe PrencipeNicola SantoroPublished in: IEICE Trans. Inf. Syst. (2006)
Keyphrases
- shortest path
- optimal path
- weighted graph
- shortest distance
- shortest path algorithm
- shortest path problem
- steiner tree
- road network
- routing algorithm
- edge weights
- minimum length
- strongly connected components
- path length
- dynamic programming
- minimal surface
- dijkstra algorithm
- minimum spanning tree
- undirected graph
- travel time
- directed graph
- source node
- optimal location
- finding the shortest path
- path queries
- geodesic distance
- dynamic environments