n = 40, 80, 100, 120, 140, 160 d = 0.25, 0.50, 0.75 There are 5 graphs for each (n,d) The k-cluster problems are generated from these graphs with k=n/4, k=n/2, and k=3n/4 where n is the number of vertices