Graph coloring problem based on learning automata

Proceedings - 2009 International Conference on Information Management and Engineering, ICIME 2009

Volumn , Issue , 2009, Pages 718-722

  Akbari Torkestani, J ^a   Meybodi, M R ^b  

^a ISLAMIC AZAD UNIVERSITY   (Iran)

^b AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

Combinatorial optimization problem; Graph coloring problem; Learning automata; Vertex coloring problem

Indexed keywords

ADJACENT VERTICES; APPROXIMATION SOLUTION; ARBITRARY GRAPHS; CLASSICAL PROBLEMS; COLORING ALGORITHMS; COLORING PROBLEMS; COMBINATORIAL OPTIMIZATION PROBLEM; GRAPH COLORING PROBLEM; LEARNING AUTOMATA; NP-HARD PROBLEM; OPTIMAL SOLUTIONS; RUNNING TIME; VERTEX COLORING PROBLEM; VERTEX COLORING PROBLEMS;

APPROXIMATION ALGORITHMS; COLOR; COLORING; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; EDUCATION; GRAPH THEORY; INFORMATION MANAGEMENT; ROBOTS; TRANSLATION (LANGUAGES);

LEARNING ALGORITHMS;

EID: 70349503812     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICIME.2009.106     Document Type: Conference Paper

References (8)

1. M.R. Garey, and D.S. Johnson, "Computers and intractability: A guide to the theory of NP-completeness", W.H. Freeman and Co., San Francisco, CA, 1979.
2. K. S. Narendra and K. S. Thathachar, "Learning Automata: An Introduction", New York, Printice-Hall, 1989.
3. M. A. L. Thathachar and B. R. Harita, "Learning Automata with hanging Number of Actions", IEEE Transactions on Systems, Man, and Cybernetics, Vol. SMG17, 1987, pp. 1095-1100.
4. H. R. Lourenco, and O. Martin, T. Stutzle, "Iterated local search", In Handbook of Metaheuristics, F. Glover, G. Kochenberger (Eds.), Kluwer Academic Publishers, USA, 2002, pp. 321-353.
5. M. Caramia, and P. Dell'Olmo, "Embedding a novel objective function in a two-phased local search for robust vertex coloring", European Journal of Operational Research, Vol. 189, 2008, pp. 1358-1380.
6. P. Galinier, A. Hertz, and N. Zufferey, "An Adaptive Memory Algorithm for the K-coloring Problem", Discrete Applied Mathematics, Vol. 156, 2008, pp. 267-279.
7. C. Voudouris, and E. P. K. Tsang, "Guided local search", In Handbook of Metaheuristics, F. Glover (Eds.), Kluwer Academic Publishers, USA, 2003, pp. 185-218.
8. M. Caramia, P. Dellolmo, and G. F. Italiano, "CHECKCOL: Improved local search for graph coloring", Journal of Discrete Algorithms, Vol. 4, 2006, pp. 277-298.