Finding the Detour-Critical Edge of a Shortest Path Between Two Nodes.
Enrico NardelliGuido ProiettiPeter WidmayerPublished in: Inf. Process. Lett. (1998)
Keyphrases
- shortest path
- weighted graph
- edge weights
- shortest path problem
- shortest path algorithm
- routing algorithm
- road network
- shortest distance
- path length
- travel time
- dijkstra algorithm
- path selection
- edge detection
- flow graph
- optimal path
- distance matrix
- geodesic distance
- path queries
- steiner tree
- minimum cost flow
- betweenness centrality
- dynamic programming
- social networks