I/O-Efficient Generation of Massive Graphs Following the LFR Benchmark
From MaRDI portal
Publication:4555542
DOI10.1145/3230743zbMath1430.68213arXiv1604.08738OpenAlexW2886935179MaRDI QIDQ4555542
No author found.
Publication date: 20 November 2018
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.08738
Analysis of algorithms (68W40) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Random permutations on distributed, external and hierarchical memory
- Algorithms for memory hierarchies. Advanced lectures
- The switch Markov chain for sampling irregular graphs and digraphs
- Limit laws for self-loops and multiple edges in the configuration model
- Mathematical foundations of complex networked information systems. Lectures of the CIME course. Politecnico di Torino, Verrès, Italy 2009
- Are We There Yet? When to Stop a Markov Chain while Generating Random Graphs
- A remark on the existence of finite graphs
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- Generating Sorted Lists of Random Numbers
- The buffer tree: A new technique for optimal I/O-algorithms
- Generating Massive Scale-Free Networks under Resource Constraints
- I/O-efficient Generation of Massive Graphs Following the LFR Benchmark
- Fast unfolding of communities in large networks
- Fast priority queues for cached memory
- Computing and Combinatorics
- Networks
This page was built for publication: I/O-Efficient Generation of Massive Graphs Following the LFR Benchmark