Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have