Are there graphs whose shortest path structure requires large edge weights?
Aaron BernsteinGreg BodwinNicole WeinPublished in: CoRR (2023)
Keyphrases
- shortest path
- edge weights
- weighted graph
- flow graph
- bipartite graph
- road network
- graph structure
- spanning tree
- minimum spanning tree
- finding the shortest path
- strongly connected components
- directed graph
- path length
- shortest path algorithm
- geodesic distance
- graph partitioning
- spatial networks
- undirected graph
- triangle inequality
- similarity measure
- travel time
- nearest neighbor