Name
Abstract | ||
|---|---|---|
We explain how massive instances of scale-free graphs following the Barabasi-Albert preferential attachment 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 ( 10 1 5 edges) in less than an hour. A parallel generator for Barabasi-Albert scalefree graphs.The algorithm is at the same time fast and simple.No communication between the processors is needed.Experiments with up to a petaedge ( 10 1 5 edges) are presented. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.ipl.2016.02.004 | Information Processing Letters |
Keywords | DocType | Volume |
Graph generators,Parallel processing,Scale-free graphs | Journal | 116 |
Issue | ISSN | Citations |
7 | 0020-0190 | 1 |
PageRank | References | Authors |
0.35 | 4 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| peter sanders | 1 | 361 | 29.35 |
| Christian Schulz | 2 | 240 | 24.10 |