Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal Data Structures for Undirected Unweighted Graphs.
Surender BaswanaNeelesh KhannaPublished in: Algorithmica (2013)
Keyphrases
- shortest path
- edge weights
- weighted graph
- undirected graph
- data structure
- directed graph
- shortest path problem
- graph partitioning
- finding the shortest path
- spanning tree
- shortest path algorithm
- approximation algorithms
- graph model
- road network
- betweenness centrality
- connected components
- geodesic distance
- path length
- spatial networks
- optimal path
- flow graph
- minimum length
- graph search
- directed acyclic graph
- shortest distance
- random walk