Parallel and I/O-efficient algorithms for non-linear preferential attachment

DOI10.1137/1.9781611977561.CH6MaRDI QIDQ6543537zbMATH OpenFDO

Authors Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran

Publication date 24 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611977561.CH6

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Analysis of algorithms (68W40)

Recommendations

• Generating Massive Scale-Free Networks under Resource Constraints
• Sublinear Random Access Generators for Preferential Attachment Graphs
• Scalable generation of scale-free graphs
• Sublinear Random Access Generators for Preferential Attachment Graphs.
• Distributed network generation based on preferential attachment in ABS

This page was built for publication: Parallel and I/O-efficient algorithms for non-linear preferential attachment

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