The six .csv files within this folder contain the results of the graph colouring experiments reported in the paper 'A General-Purpose Hill-Climbing Method for Order Independent Minimum Grouping Problems: A Case Study in Graph Colouring and Bin Packing' published in Computers and Operations Research.

Note that these files contain a listing of the number of colours (i.e. groups) being used in the best solutions found within the run cut-off points described in the paper. No information is given about at what point during the run these solutions were found. For further details please refer to the above publication.

These results are released to aid people in their own statistical analyses.

Finally, note that these experiments were carried out using the Condor pool at Cardiff University, Wales. In a few cases, results to a small number of experiments were not returned. This means that occasionally there is a small variation on the number of results reported for a particular value of p (edge probability) and n (number of nodes).  

If you notice any mistakes with any of these files (it is possible as I constructed them by cutting-and-pasting) please let me know by emailing Rhyd Lewis at LewisR9@cf.ac.uk

Iachi da!!!

Rhyd Lewis 18/09/2008