activity
20162025
most citedThe random 2-SAT partition function

13 citations · 39 across the 12 of their papers we have counts for

collaborators
Showing 2016Show all

1 paper · 1 filter

cs.DS2016

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

Michael Hamann, Ulrich Meyer, Manuel Penschuck +2

LFR is a popular benchmark graph generator used to evaluate community detection algorithms. We present EM-LFR, the first external memory algorithm able to generate massive complex…