22 citations · 22 across the 1 of their papers we have counts for
1 paper
Aydin Buluc, Scott Beamer, Kamesh Madduri +2
This chapter studies the problem of traversing large graphs using the breadth-first search order on distributed-memory supercomputers. We consider both the traditional level-synchr…