Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances.
Václav RozhonBernhard HaeuplerAnders MartinssonChristoph GrunauGoran ZuzicPublished in: CoRR (2022)
Keyphrases
- shortest path
- breadth first search
- depth first search
- shortest distance
- routing problem
- geodesic distance
- shortest path algorithm
- graph search
- search tree
- routing algorithm
- finding the shortest path
- road network
- weighted graph
- search algorithm
- neighborhood sequences
- optimal path
- travel time
- euclidean distance
- xml data
- search space
- social networks