How Well Can Ants Color Graphs?

Skoči na glavni sadržaj

Journal of computing and information technology, Vol. 8 No. 2, 2000.

Izvorni znanstveni članak

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

How Well Can Ants Color Graphs?

Janez Žerovnik
Aleksander Vesel

Puni tekst: engleski pdf 154 Kb

str. 131-136

preuzimanja: 1.202

APA 6th Edition

Žerovnik, J. i Vesel, A. (2000). How Well Can Ants Color Graphs?. Journal of computing and information technology, 8 (2), 131-136. https://doi.org/10.2498/cit.2000.02.04

MLA 8th Edition

Žerovnik, Janez i Aleksander Vesel. "How Well Can Ants Color Graphs?." Journal of computing and information technology, vol. 8, br. 2, 2000, str. 131-136. https://doi.org/10.2498/cit.2000.02.04. Citirano 22.12.2024.

Chicago 17th Edition

Žerovnik, Janez i Aleksander Vesel. "How Well Can Ants Color Graphs?." Journal of computing and information technology 8, br. 2 (2000): 131-136. https://doi.org/10.2498/cit.2000.02.04

Harvard

Žerovnik, J., i Vesel, A. (2000). 'How Well Can Ants Color Graphs?', Journal of computing and information technology, 8(2), str. 131-136. https://doi.org/10.2498/cit.2000.02.04

Vancouver

Žerovnik J, Vesel A. How Well Can Ants Color Graphs?. Journal of computing and information technology [Internet]. 2000 [pristupljeno 22.12.2024.];8(2):131-136. https://doi.org/10.2498/cit.2000.02.04

IEEE

J. Žerovnik i A. Vesel, "How Well Can Ants Color Graphs?", Journal of computing and information technology, vol.8, br. 2, str. 131-136, 2000. [Online]. https://doi.org/10.2498/cit.2000.02.04

Sažetak

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.

Ključne riječi

Hrčak ID:

44845

URI

https://hrcak.srce.hr/44845

Datum izdavanja:

30.6.2000.

Posjeta: 1.814 *