How Well Can Ants Color Graphs?

Aleksander Vesel, Janez Žerovnik

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.

Full Text:

PDF


DOI: https://doi.org/10.2498/cit.2000.02.04

Creative Commons License
This work is licensed under a Creative Commons Attribution-NoDerivatives 4.0 International License.

Crossref Similarity Check logo

Crossref logologo_doaj

 Hrvatski arhiv weba logo