I/O-Efficient Generation of Massive Graphs Following the <i>LFR</i> Benchmark (Q4555542)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: I/O-Efficient Generation of Massive Graphs Following the LFR Benchmark |
scientific article; zbMATH DE number 6981841
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | I/O-Efficient Generation of Massive Graphs Following the <i>LFR</i> Benchmark |
scientific article; zbMATH DE number 6981841 |
Statements
I/O-Efficient Generation of Massive Graphs Following the <i>LFR</i> Benchmark (English)
0 references
20 November 2018
0 references
LFR benchmark
0 references
community detection
0 references
complex network
0 references
external memory algorithms
0 references
random graph generator
0 references
