Handbook of combinatorics (vol. 1)
Handbook of combinatorics (vol. 1)
Exact coloring of real-life graphs is easy
DAC '97 Proceedings of the 34th annual Design Automation Conference
Frozen development in graph coloring
Theoretical Computer Science - Phase transitions in combinatorial problems
Improving graph colouring algorithms and heuristics using a novel representation
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Comparing evolutionary algorithms on binary constraint satisfaction problems
IEEE Transactions on Evolutionary Computation
| Hi-index | 0.00 |
Graph vertex colouring can be defined in such a way where colour assignments are substituted by vertex contractions. We present various hyper-graph representations for the graph colouring problem all based on the approach where vertices are merged into groups. In this paper, we show this provides a uniform and compact way to define algorithms, both of a complete or a heuristic nature. Moreover, the representation provides information useful to guide algorithms during their search. In this paper we focus on the quality of solutions obtained by graph colouring heuristics that make use of higher order properties derived during the search. An evolutionary algorithm is used to search permutations of possible merge orderings.