Parallel Cluster-BFS and Applications to Shortest Paths

Letong Wang, Guy Blelloch, Yan Gu +1

Breadth-first Search (BFS) is one of the most important graph processing subroutines, especially for computing the unweighted distance. Many applications may require running BFS fr…