How well can ants color graphs?

Journal of Computing and Information Technology

Volumn 8, Issue 2, 2000, Pages 131-136

  Vesel, Aleksander ^a   Žerovnik, Janez ^a,b  

^a UNIVERSITY OF MARIBOR   (Slovenia)

^b INSTITUTE OF MATHEMATICS   (Slovenia)

Author keywords

Ants algorithm; Graph coloring; Petford welsh; RLF

Indexed keywords

COMPUTER SCIENCE;

ANTS ALGORITHMS; COLOR GRAPHS; GRAPH COLORINGS; PETFORD-WELSH;

GRAPH THEORY;

EID: 85007433458     PISSN: 13301136     EISSN: 18463908     Source Type: Journal    
DOI: 10.2498/cit.2000.02.04     Document Type: Article

References (20)

1. D. BRELAZ, New methods to color vertices of a graph, Communications of the ACM 22 (1979)251-256.
2. B. BOLLOBAS, Random graphs, Academic Press, London 1985.
3. B. CHAMARET, S. UBEDA, J. ŽEROVNIK, A Randomized Algorithm for Graph Coloring Applied to Channel Allocation in Mobile Telephone Networks, in Proceedings of the 6th International Conference on Operational Research KOI'96 (T.HUNJAK, LJ.MARTIĆ, L.NERALIĆ, Eds), (1996) pp. 25-30, Hrvatsko društvo za operacijska istraživanja, Zagreb.
4. A. COLORNI, M. DORIGO AND V. MANIEZZO, Distributed optimization by ant colonies, in Proceedings of the first European Conference on Artificial Life (F.J. VARELA AND P. BOURGINE, Eds.), (1991) pp. 134-142, MIT Press_Bradford Books, Cambridge, Massachusetts.
5. D. COSTA, A. HERTZ AND O. DUBUIS, Embedding of a sequential algorithm within an evolutionary algorithm for coloring problems in graphs, Journal of Heuristics, 1(1995), 105-128.
6. D. COSTA AND A. HERTZ, Ants can colour graphs, Journal of the Operational Research Society, 48(1997), 295-305.
7. C. FLEURENT AND J.A. FERLAND, Genetic and hybrid algorithms for graph coloring, Annals of Operations Research, 63(1996), 437-461.
8. M.R. GAREY, D.S. JOHNSON, Computers and Intractability, Freeman, San Francisco 1979.
9. F. LEIGHTON, A graph coloring algorithm for large scheduling problems, J. Res. National Bureau of Standards, 84(1979), 489-505.
10. D.S. JOHNSON, M. TRICK,(editors) Cliques, Coloring and Satisfiability, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, AMS, Rhode Island 1996. (DIMACS coloring benchmarks available via ftp at rutgers.dimacs.edu)
11. D.S. JOHNSON, C.A. ARAGON, L.A. MCGEOCH, C. SCHEVON, Optimization by Simulated Annealing: an Experimental Evaluation - Part II (Graph Coloring and Number Partitioning), Operations Research 31 (1991), 378-406.
12. A.D. PETFORD, D.J.A. WELSH, A randomized 3- colouring algorithm, Discrete Mathematics 74 (1989), 253-261.
13. J. SHAWE-TAYLOR, J. ŽEROVNIK, Boltzmann Machines with Finite Alphabet, in Artificial Neural Networks 2, vol. 1. (I.ALEKSANDER, J.TAYLOR Eds.), (1992) pp. 391-394, Elsevier Science Publishers B.V., Amsterdam.
14. J. SHAWE-TAYLOR, J. ŽEROVNIK, Analysis of the Mean Field Annealing Algorithm for Graph Colouring, Journal of Artificial Neural Networks, 2(1995), 329-340.
15. J. SHAWE-TAYLOR, J. ŽEROVNIK, Adapting temperature for some randomized local search algorithms, Preprint series Dept. Math., University of Ljubljana, vol. 36 (1998) no. 614.
16. K. STECKE, Design Planning, Scheduling and Control Problems of Flexible Manufacturing, Annals of Operations Research, 3(1985), 3-12.
17. S. UBÉDA, J. ŽEROVNIK, A randomized algorithm for graph coloring applied to channel assignment problem, in Proceedings of the 4th International Symposium on Operational Research (V.RUPNIK, L.ZADNIK STIRN, S.DROBNE, Eds.), (1997) pp. 361-366, Slovenian Society INFORMATIKA - Section for Operational Research, Ljubljana.
18. D.J.A. WELSH, M.B. POWELL, An upper bound for the chromatic number of a graph and its application to timetabling problems, The Computer Journal, 10(1967), 85-86.
19. J. ŽEROVNIK, A randomised heuristical algorithm for estimating the chromatic number of a graph, Information Processing Letters, 33(1989), 213-219.
20. J. ŽEROVNIK, A Randomized Algorithm for k- colorability, Discrete Mathematics, 131(1994), 379-393.