How Well Can Ants Color Graphs?
|
Title | How Well Can Ants Color Graphs? |
Authors | |
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. |
Publisher | University of Zagreb, University Computing Centre - SRCE |
Date | 1970-01-01 |
Source | Journal of Computing and Information Technology Vol 8, No 2 (2000): Section on Biomedical Image Processing and Analysis |
Rights | CIT. Journal of Computing and Information Technology is an open access journal.Authors who publish with this journal agree to the following terms:Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work´s authorship and initial publication in this journal.Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal´s published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access). |