Scalable generation of scale-free graphs

From MaRDI portal
Publication:269740

DOI10.1016/J.IPL.2016.02.004zbMATH Open1356.68163arXiv1602.07106OpenAlexW2964251804MaRDI QIDQ269740FDOQ269740


Authors: Christian Schulz, Peter Sanders Edit this on Wikidata


Publication date: 6 April 2016

Published in: Information Processing Letters (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1602.07106




Recommendations




Cites Work


Cited In (8)





This page was built for publication: Scalable generation of scale-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q269740)