Improving graph colouring algorithms and heuristics using a novel representation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3906 LNCS, Issue , 2006, Pages 123-134

  Juhos, István ^a   Van Hemert, Jano I ^b  

^a UNIVERSITY OF SZEGED   (Hungary)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Graph colouring; Heuristics; Merge model; Representation

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC PROGRAMMING; MATHEMATICAL MODELS; PHASE TRANSITIONS;

GRAPH COLOURING; HEURISTICS; MERGE MODEL; REPRESENTATION;

GRAPH THEORY;

EID: 33745790662     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11730095_11     Document Type: Conference Paper

References (14)

1. de Werra, D.: An introduction to timetabling. European Journal of Operations Research 19 (1985) 151-162
2. Briggs, P.: Register allocation via graph coloring. Technical Report TR92-183 (1998)
3. Garey, M., Johnson, D., So, H.: An application of graph colouring to printed circuit testing. IEEE Transaction on Circuits and Systems CAS-23 (1976) 591-599
4. Garey, M., Johnson, D.: Computers and Instractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco, CA (1979)
5. Craenen, B., Eiben, A., van Hemert, J.: Comparing evolutionary algorithms on binary constraint satisfaction problems. IEEE Transactions on Evolutionary Computation 7 (2003) 424-444
6. Juhos, I., Tóth, A., van Hemert, J.: Binary merge model representation of the graph colouring problem. In Raidl, G., Gottlieb, J., eds.: Evolutionary Computation in Combinatorial Optimization. Volume 3004 of LNCS., Springer (2004) 124-134
7. Juhos, I., Tóth, A., van Hemert, J.: Heuristic colour assignment strategies for merge models in graph colouring. In: Evolutionary Computation in Combinatorial Optimization. Volume 3448 of LNCS., Springer (2005) 132-143
8. Brélaz, D.: New methods to color the vertices of a graph. Communications of the ACM 22 (1979) 251-256
9. CNET: Xbox specs revealed (http://cnet.com/xbox+specs+revealed/2100-1043- 3-5705372.html) (2005) Accessed: Nov. 10, 2005.
10. Golomb, S., Baumert, L.: Backtrack programming. ACM 12 (1965) 516-524
11. Back, T., Fogel, D., Michalewicz, Z., eds.: Handbook of Evolutionary Computation. Institute of Physics Publishing Ltd, Oxford University Press (1997)
12. Johnson, D., Trick, M.: Cliques, Coloring, and Satisfiability. American Mathematical Society, DIMACS (1996)
13. Culberson, J.: Iterated greedy graph coloring and the difficulty landscape. Technical Report TR 92-07, University of Alberta, Dept. of Computing Science (1992)
14. Cheeseman, P., Kenefsky, B., Taylor, W.: Where the really hard problems are. In: Proceedings of the IJCAI'91. (1991) 331-337