Parallel calculation of shortest paths in sparse graphs on a systolic array.
Sabine BauerUwe SchwiegelshohnPublished in: ICCD (1988)
Keyphrases
- shortest path
- systolic array
- finding the shortest path
- weighted graph
- reconfigurable architecture
- parallel architecture
- data flow
- shortest path problem
- shortest path algorithm
- strongly connected components
- road network
- edge weights
- directed graph
- travel time
- flow graph
- betweenness centrality
- high dimensional
- graph partitioning
- dynamic programming
- optimal path
- spatial networks
- graph model
- path length
- geodesic distance
- minimum cost flow
- graph theory
- bipartite graph
- parallel processing
- sparse representation