Maintaining all-pairs approximate shortest paths under deletion of edges.
Surender BaswanaRamesh HariharanSandeep SenPublished in: SODA (2003)
Keyphrases
- shortest path
- weighted graph
- shortest path algorithm
- edge weights
- road network
- shortest path problem
- strongly connected components
- path length
- flow graph
- travel time
- shortest distance
- pairwise
- edge detector
- spanning tree
- finding the shortest path
- spatial networks
- minimum cost flow
- minimum length
- bipartite graph
- query processing