Scalable generation of scale-free graphs

DOI10.1016/j.ipl.2016.02.004zbMath1356.68163arXiv1602.07106OpenAlexW2964251804MaRDI QIDQ269740

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

zbMATH Keywords

parallel processinggraph generatorsscale-free graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• The degree sequence of a scale-free random graph process
• Emergence of Scaling in Random Networks
• Generating Massive Scale-Free Networks under Resource Constraints
• Unnamed Item

This page was built for publication: Scalable generation of scale-free graphs