Parallelization of All-Pairs-Shortest-Path Algorithms in Unweighted Graph.
Masahiro NakaoHitoshi MuraiMitsuhisa SatoPublished in: HPC Asia (2020)
Keyphrases
- shortest path
- edge weights
- shortest path algorithm
- weighted graph
- strongly connected components
- shortest path problem
- graph search
- betweenness centrality
- graph theory
- minimum cost flow
- road network
- bipartite graph
- path length
- flow graph
- minimum spanning tree
- data structure
- reverse nearest neighbor
- optimal path
- geodesic distance
- spanning tree
- travel time
- random walk