------------------------------------
We are proud to announce the release of our massively distributed graph generation framework KaGen (Karlsruhe Graph Generation).
Our framework provides scalable graph generators for different graph models including:
Erdos-Renyi graphs, random geometric graphs, random Delaunay graphs, random hyperbolic graphs and Barabassi-Albert graphs.
Our generators are built using a communication-free paradigm that makes use of local recomputations instead of communication.
This is achieved by using divide-and-conquer schemes in combination with pseudorandomness via high-quality hash functions.
We hope that our generators provide new experimental possibilities for researchers and practitioners on a massive scale.
GitHub
https://github.com/sebalamm/KaGen
Best Regards,
Daniel Funke, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, and Moritz von Looz
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
