162 citations · 185 across the 3 of their papers we have counts for
3 papers
cs.DS2021★ 1 cited
Accelerating Clique Counting in Sparse Real-World Graphs via Communication-Reducing Optimizations
Amogh Lonkar, Scott Beamer
Counting instances of specific subgraphs in a larger graph is an important problem in graph mining. Finding cliques of size k (k-cliques) is one example of this NP-hard problem. Di…
cs.DC2017★ 22 cited
Distributed-Memory Breadth-First Search on Massive Graphs
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…
cs.DC2015★ 162 cited
The GAP Benchmark Suite
Scott Beamer, Krste Asanović, David Patterson
We present a graph processing benchmark suite with the goal of helping to standardize graph processing evaluations. Fewer differences between graph processing evaluations will make…