Scalable Generation of Scale-free Graphs

Abstract

We explain how massive instances of scale-free graphs following the Barabasi-Albert model can be generated very quickly in an embarrassingly parallel way. This makes this popular model available for studying big data graph problems. As a demonstration, we generated a Petaedge graph in less than an hour. 
DOI: 10.1016/j.ipl.2016.02.004

Topics

2 Figures and Tables

Cite this paper

@article{Sanders2016ScalableGO, title={Scalable Generation of Scale-free Graphs}, author={Peter Sanders and Christian Schulz}, journal={Inf. Process. Lett.}, year={2016}, volume={116}, pages={489-491} }