Linear Work Generation of R-MAT Graphs
arXiv:1905.03525 · doi:10.1017/nws.2020.21
Abstract
R-MAT is a simple, widely used recursive model for generating `complex network' graphs with a power law degree distribution and community structure. We make R-MAT even more useful by reducing the required work per edge from logarithmic to constant. The algorithm works in an embarrassingly parallel way.