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