How to Swap a Failing Edge of a Single Source Shortest Paths Tree.
Enrico NardelliGuido ProiettiPeter WidmayerPublished in: COCOON (1999)
Keyphrases
- shortest path
- single source
- shortest path problem
- weighted graph
- edge weights
- spanning tree
- road network
- routing algorithm
- path length
- shortest path algorithm
- geodesic distance
- edge detection
- optimal path
- finding the shortest path
- minimal surface
- travel time
- graph cuts
- multi source
- multiple objectives
- index structure
- search algorithm
- data sets