David Chalupa
A freelance computer scientist | specialized software engineer
Social Network Samples
This is a set of anonymised social network samples, which were used as a testbed in papers listed at the bottom of this page. Please refer to the corresponding paper below, if you use the data.

All instances are in the standard DIMACS format for graph coloring. Please note that the graphs are intended as undirected for the purpose of the papers below, i.e. [x,y] and [y,x] in the files represent essentially the same edge.
Google+
gplus_200
gplus_500
gplus_2000
gplus_10000
gplus_20000
gplus_50000
Pokec
pokec_500
pokec_2000
pokec_10000
pokec_20000
pokec_50000
Other
soc52
References
An Order-based Algorithm for Minimum Dominating Set with Application in Graph Mining
Chalupa, D.
Information Sciences, 426, 101-116, 2018
Mining k-Reachable Sets in Real-world Networks Using Domination in Shortcut Graphs
Chalupa, D., Blum, C.
Journal of Computational Science, 22, 1-14, 2017
Computational Methods for Finding Long Simple Cycles in Complex Networks
Chalupa, D., Balaghan, P., Hawick, K. A., Gordon, N. A.
Knowledge-Based Systems, 125, 91-105, 2017
David Chalupa, 2020 | Free icons by www.iconfinder.com