Heuristic colour assignment strategies for merge models in graph colouring

Lecture Notes in Computer Science

Volumn 3448, Issue , 2005, Pages 132-143

  Juhos, István ^a   Tóth, Attila ^a   Van Hemert, Jano I ^b  

^a UNIVERSITY OF SZEGED   (Hungary)

^b EDINBURGH NAPIER UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EVOLUTIONARY ALGORITHMS; HEURISTIC METHODS; MATHEMATICAL MODELS;

GRAPH COLORING; NOVEL STRATEGIES; PROBLEM INSTANCES;

GRAPH THEORY;

EID: 24644473645     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31996-2_13     Document Type: Conference Paper

References (15)

1. Jensen, T., Toft, B.: Graph Coloring Problems. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons, Inc (1995)
2. Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach, second edn. Prentice Hall Series in Artificial Intelligence. Englewood Cliffs, New Jersey (1995)
3. Schumacher, C., Vose, M., Whitley, L.: The no free lunch and problem description length. In Spector, L., Goodman, E.D., Wu, A., Langdon, W.B., Voigt, H.M., Gen, M., Sen, S., Dorigo, M., Pezeshk, S., Garzon, M.H., Burke, E., eds.: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), Morgan Kaufmann (2001) 565-570
4. Wolpert, D., Macready, W.: No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation 1 (1997) 67-82
5. Culberson, J.: On the futility of blind search: An algorithmic view of "No Free Lunch". Evolutionary Computation 69 (1998) 109-128
6. Glover, F., Kochenberger, W., Gary, A.: Handbook of Metaheuristics. Volume 57 of International Series in Operations Research and Management Science. Kluwer (2003)
7. Burke, E., Kendall, G., Soubeiga, E.: A tabu-search hyper-heuristic for timetabling and rostering. Journal of Heuristics 9 (2003) 451-470
8. Juhos, I., Tóth, A., van Hemert, J.: Binary merge model representation of the graph colouring problem. In Gottlieb, J., Raidl, G., eds.: Evolutionary Computation in Combinatorial Optimization. (2004) 124-134
9. Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the Really Hard Problems Are. In: Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, IJCAI-91, Sidney, Australia. (1991) 331-337
10. Back, T., Fogel, D., Michalewicz, Z., eds.: Handbook of Evolutionary Computation. Institute of Physics Publishing Ltd, Bristol and Oxford University Press (1997)
11. Johnson, D., Trick, M.: Cliques, Coloring, and Satisfiability. American Mathematical Society, DIMACS (1996)
12. Leighton, F.T.: A graph colouring algorithm for large scheduling problems. J. Res. National Bureau Standards 84 (1979) 489-503
13. Dimitris Fotakis, Spyros Likothanassis, S.S.: An evolutionary annealing approach to graph coloring. In: Proceedings of Applications of Evolutionary Computing, EvoWorkshops 2001. (2001) 120-129
14. Brélaz, D.: New methods to color the vertices of a graph. Communications of the ACM 22 (1979) 251-256
15. Culberson, J.: Iterated greedy graph coloring and the difficulty landscape. Technical Report TR 92-07, University of Alberta, Dept. of Computing Science (1992)