Generating Massive Scale-Free Networks under Resource Constraints

DOI10.1137/1.9781611974317.4MaRDI QIDQ5232544zbMATH OpenOpenAlexFDO

Authors Ulrich Meyer, Manuel Penschuck

Publication date 12 September 2019

Published in 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

Recommendations

• Scalable generation of scale-free graphs
• Generating large scale‐free networks with the Chung–Lu random graph model
• Scaling: a canonical design problem for networks
• Efficiently Computing Maximum Flows in Scale-Free Networks.
• Exactly scale-free scale-free networks
• Efficient generation of networks with given expected degrees
• Optimization and scale-freeness for complex networks
• Generating random networks from a given distribution
• Scale-free networks: a decade and beyond

Cited in

(9)

• Scalable generation of scale-free graphs
• Distributed network generation based on preferential attachment in ABS
• I/O-efficient generation of massive graphs following the \textit{LFR} benchmark
• Large-scale graph generation and big data: an overview on recent results
• Sublinear Random Access Generators for Preferential Attachment Graphs.
• I/O-efficient generation of massive graphs following the LFR benchmark
• Scaling: a canonical design problem for networks
• Parallel and I/O-efficient algorithms for non-linear preferential attachment
• Parallelism in simulation and modeling of scale-free complex networks

This page was built for publication: Generating Massive Scale-Free Networks under Resource Constraints

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