## Random Geometric Graphs

rggX is a random geometric graph with *2^X* vertices. Each vertex is a random
point in the unit square and edges connect vertices whose Euclidean distance
is below *0.55 ln n/n*. This threshold was choosen in order to ensure that the
graph is almost connected.

Reference: M. Holtgrewe, P. Sanders, and C. Schulz. Engineering a Scalable High Quality Graph Partitioner. 24th IEEE International Parallal and Distributed Processing Symposium, 2010.

#### Graph Files

All files are compressed using bzip2. The number of vertices are all powers of two. The file names are marked by the base-2 logarithm of the graph sizes.