A Unified Approach for All Pairs Approximate Shortest Paths in Weighted Undirected Graphs.
Maor AkavLiam RodittyPublished in: ESA (2021)
Keyphrases
- shortest path
- undirected graph
- weighted graph
- betweenness centrality
- complex networks
- edge weights
- vertex set
- directed graph
- shortest path algorithm
- spanning tree
- directed acyclic graph
- approximation algorithms
- road network
- graph structure
- multicommodity flow
- finding the shortest path
- disjoint paths
- minimum cost
- geodesic distance
- optimal path
- travel time
- flow graph
- connected components
- minimal surface
- routing problem
- minimum cost flow
- origin destination
- routing algorithm
- social networks
- path length
- spatial networks
- social network analysis