Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs.
Michael FeldmannKristian HinnenthalChristian ScheidelerPublished in: OPODIS (2020)
Keyphrases
- shortest path algorithm
- shortest path
- finding the shortest path
- minimum cost flow
- edge weights
- graph theory
- weighted graph
- path length
- optimal solution
- strongly connected components
- binary images
- road network
- spatial networks
- graph partitioning
- shortest path problem
- graph search
- sparse representation
- dijkstra algorithm