A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
How Well Can Ants Color Graphs?
2000
Journal of Computing and Information Technology
Preserved Fulltext
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