I/O-efficient Generation of Massive Graphs Following the LFR Benchmark

DOI10.1137/1.9781611974768.5zbMath1430.68214OpenAlexW2963166370MaRDI QIDQ5232564

Dorothea Wagner, Michael Hamann, Manuel Penschuck, Ulrich Meyer

Publication date: 12 September 2019

Published in: 2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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)

Related Items (2)

I/O-Efficient Generation of Massive Graphs Following the LFR Benchmark ⋮ Unnamed Item

This page was built for publication: I/O-efficient Generation of Massive Graphs Following the LFR Benchmark