Scalable generation of scale-free graphs
DOI10.1016/J.IPL.2016.02.004zbMATH Open1356.68163arXiv1602.07106OpenAlexW2964251804MaRDI QIDQ269740FDOQ269740
Authors: Christian Schulz, Peter Sanders
Publication date: 6 April 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.07106
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cites Work
Cited In (8)
- A Scalable Generative Graph Model with Community Structure
- Generating Massive Scale-Free Networks under Resource Constraints
- I/O-efficient generation of massive graphs following the \textit{LFR} benchmark
- I/O-efficient generation of massive graphs following the LFR benchmark
- Parallelism in simulation and modeling of scale-free complex networks
- Distributed network generation based on preferential attachment in ABS
- Large-scale graph generation and big data: an overview on recent results
- Parallel and I/O-efficient algorithms for non-linear preferential attachment
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)