Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances.
Václav RozhonBernhard HaeuplerAnders MartinssonChristoph GrunauGoran ZuzicPublished in: STOC (2023)
Keyphrases
- shortest path
- breadth first search
- depth first search
- routing problem
- shortest distance
- geodesic distance
- graph search
- shortest path algorithm
- search tree
- road network
- routing algorithm
- neighborhood sequences
- finding the shortest path
- search algorithm
- weighted graph
- travel time
- external memory
- branch and bound
- optimal path
- spanning tree
- tree search