Distances and shortest paths on graphs of bounded highway dimension: simple, fast, dynamic.
Sébastien ColletteJohn IaconoPublished in: CoRR (2023)
Keyphrases
- shortest path
- finding the shortest path
- weighted graph
- geodesic distance
- shortest path algorithm
- shortest distance
- path length
- minimum length
- strongly connected components
- road network
- shortest path problem
- spatial networks
- dynamic environments
- graph model
- social network analysis
- minimum cost flow
- neighborhood sequences
- travel time
- wireless sensor networks
- directed graph
- euclidean distance
- k nearest neighbor
- distance measure