Data Sets for the paper:
Bui, T. N. and C. M. Zrncic,
``An Ant-Based Algorithm for Finding Degree-Constrained Minimum Spanning Tree,''
Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2006), ACM Press, Seattle, July 2006, pp. 11-18. (received the best paper award in the Ant Colony Optimization and Swarm Intelligence Track)

• Random and "misleading, hard" graphs used in IEEE papers (Knowles & Corne, Raidl & Julstrom), 50 — 500 nodes. For n = 500, edge weights were: min = 0.000019, max = 0.999997, avg. = 0.697
• CRD, SYM, STR, and SHRD graphs described by Krishnamoorthy paper, 30 — 100 nodes.