Improving Graph Colouring Algorithms and Heuristics Using a Novel Representation
We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of an algorithm. Moreover, our model provides useful information for guiding heuristics as well as a compact description for algorithms. To verify the potential of the model, we use it in dsatur, in an evolutionary algorithm, and in the same evolutionary algorithm extended with heuristics. An empiricial investigation is performed to show an increase in efficiency on two problem suites , a set of practical problem instances and a set of hard problem instances from the phase transition.
Keywordsgraph colouring representation heuristics merge model
Unable to display preview. Download preview PDF.
- 2.Briggs, P.: Register allocation via graph coloring. Technical Report TR92-183 (1998)Google Scholar
- 9.CNET: Xbox specs revealed (2005) (accessed November 10, 2005), http://cnet.com/xbox+specs+revealed/2100-1043_3-5705372.html
- 11.Bäck, T., Fogel, D., Michalewicz, Z. (eds.): Handbook of Evolutionary Computation. Institute of Physics Publishing Ltd., Oxford University Press (1997)Google Scholar
- 12.Johnson, D., Trick, M.: Cliques, Coloring, and Satisfiability. American Mathematical Society, DIMACS (1996)Google Scholar
- 13.Culberson, J.: Iterated greedy graph coloring and the difficulty landscape. Technical Report TR 92-07, University of Alberta, Dept. of Computing Science (1992)Google Scholar
- 14.Cheeseman, P., Kenefsky, B., Taylor, W.: Where the really hard problems are. In: Proceedings of the IJCAI 1991, pp. 331–337 (1991)Google Scholar