Maintaining shortest paths under deletions in weighted directed graphs: [extended abstract].
Aaron BernsteinPublished in: STOC (2013)
Keyphrases
- extended abstract
- directed graph
- shortest path
- edge weights
- shortest path problem
- weighted graph
- random walk
- shortest path algorithm
- road network
- directed acyclic graph
- finding the shortest path
- graph structure
- betweenness centrality
- spatial networks
- flow graph
- travel time
- shortest distance
- strongly connected
- geodesic distance
- optimal path
- path length
- maximum flow
- minimum cost flow
- data points
- markov chain
- graph structures
- graph model
- spanning tree