Keywords: Graph Colouring [rss]
2008
[9] Contraction-Based Heuristics to Improve the Efficiency of Algorithms Solving the Graph Colouring Problem (I. Juhos, J.I. van Hemert), Chapter in Recent Advances in Evolutionary Computation for Combinatorial Optimization (C. Cotta, J.I. van Hemert, eds.), Springer, 2008. [bib]
[8] Graph Colouring Heuristics Guided by Higher Order Graph Properties (I. Juhos, J.I. van Hemert), In Evolutionary Computation in Combinatorial Optimization (J. van Hemert, C. Cotta, eds.), Springer, volume 4972, 2008. [bib]
2006
[7] Increasing the efficiency of graph colouring algorithms with a representation based on vector operations (I. Juhos, J.I. van Hemert), In Journal of Software, volume 1, 2006. [bib]
[6] Improving Graph Colouring Algorithms and Heuristics Using a Novel Representation (I. Juhos, J.I. van Hemert), In Evolutionary Computation in Combinatorial Optimization (J. Gottlieb, G. Raidl, eds.), Springer, 2006. [bib]
2005
[5] Heuristic Colour Assignment Strategies for Merge Models in Graph Colouring (I. Juhos, A. Tóth, J.I. van Hemert), In Evolutionary Computation in Combinatorial Optimization (G. Raidl, J. Gottlieb, eds.), Springer, 2005. [bib]
2004
[4] Binary Merge Model Representation of the Graph Colouring Problem (I. Juhos, A. Tóth, J.I. van Hemert), In Evolutionary Computation in Combinatorial Optimization (J. Gottlieb, G. Raidl, eds.), Springer, 2004. [bib]
2003
[3] A new permutation model for solving the graph k-coloring problem (I. Juhos, A. Tóth, M. Tezuka, P. Tann, J.I. van Hemert), In Kalmàr Workshop on Logic and Computer Science, 2003. [bib]
1998
[2] Graph Coloring with Adaptive Evolutionary Algorithms (A.E. Eiben, J.K. van der Hauw, J.I. van Hemert), In Journal of Heuristics, Kluwer Academic Publishers, volume 4, 1998. [bib]
1997
[1] Comparison of the SAW-ing Evolutionary Algorithm and the Grouping Genetic Algorithm for Graph Coloring (J.I. van Hemert, A.E. Eiben), Technical report, Leiden University, 1997. [bib]
Powered by bibtexbrowser