A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree.
Davide BilòLuciano GualàGuido ProiettiPublished in: ESA (2013)
Keyphrases
- shortest path
- weighted graph
- shortest path algorithm
- spatial networks
- shortest path problem
- spanning tree
- strongly connected components
- road network
- edge weights
- path length
- tree structure
- finding the shortest path
- routing algorithm
- travel time
- geodesic distance
- flow graph
- index structure
- optimal path
- r tree
- betweenness centrality
- minimal surface
- directed graph
- minimum cost flow
- graph cuts
- high dimensional