Distances and shortest paths on graphs of bounded highway dimension: simple, fast, dynamic.
Sébastien ColletteJohn IaconoPublished in: SODA (2024)
Keyphrases
- shortest path
- finding the shortest path
- weighted graph
- shortest distance
- road network
- geodesic distance
- path length
- shortest path problem
- dynamic environments
- graph theory
- strongly connected components
- graph search
- minimum length
- optimal path
- distance measure
- shortest path algorithm
- travel time
- graph partitioning
- image segmentation