How Well Can Ants Color Graphs?

Aleksander Vesel, Janez �erovnik
2000 Journal of Computing and Information Technology  
We compare the ants algorithm for graph coloring recently proposed by Costa and Hertz with the repeated Recursive Largest First algorithm and with a Petford-Welsh type algorithm. In our experiments, the latter is much better than the first two.
doi:10.2498/cit.2000.02.04 fatcat:rnfptm27dbhnlhidw7e5rnnfei