Comments on "the 1993 DIMACS graph coloring challenge" and "energy function-based approaches to graph coloring".
Since all graphs in the 1993 DIMACS graph coloring challenge are undirected, each edge should be only counted once. However, in some files each edge is counted once, whereas in others each edge is counted twice; so a systematical check on the DIMACS challenge is made to eliminate the inconsistencies. Besides, the experimental results of a previous paper by Blas et al. counted each violated edges twice and neglected the inconsistencies in the DIMACS challenge. So the correct experimental results of a previous paper by Blas et al are also given.
Liu
Jing
J
Zhong
Weicai
W
Jiao
Licheng
L
D000465:Algorithms; D001185:Artificial Intelligence; D003124:Colorimetry / Q000379:methods*; D003196:Computer Graphics; D003198:Computer Simulation; D003661:Decision Support Techniques; D007090:Image Interpretation, Computer-Assisted / Q000379:methods*; D008962:Models, Theoretical; D016571:Neural Networks, Computer; D009716:Numerical Analysis, Computer-Assisted; D010363:Pattern Recognition, Automated / Q000379:methods*