Maintaining Shortest Paths Under Deletions in Weighted Directed Graphs.
Aaron BernsteinPublished in: SIAM J. Comput. (2016)
Keyphrases
- directed graph
- shortest path
- shortest path problem
- edge weights
- weighted graph
- random walk
- shortest path algorithm
- road network
- betweenness centrality
- finding the shortest path
- undirected graph
- maximum flow
- directed acyclic graph
- optimal path
- flow graph
- spatial networks
- graph structure
- travel time
- geodesic distance
- graph structures
- special case
- disjoint paths