Original scientific paper
https://doi.org/10.2498/cit.2000.02.04
How Well Can Ants Color Graphs?
Janez Žerovnik
Aleksander Vesel
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.
Keywords
Hrčak ID:
44845
URI
Publication date:
30.6.2000.
Visits: 1.600 *