Scalable Generation of Scale-free Graphs
classification
💻 cs.DS
cs.DCcs.SI
keywords
generatedgraphgraphsmodelscale-freeavailablebarabasi-albertdata
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.