These fies have been generated as Delaunay triangulations of random points in the unit square.

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.