Improving graph colouring algorithms and heuristics using a novel representation

Authors:
István Juhos;Jano I. van Hemert
Affiliations:
Department of Computer Algorithms and Artificial Intelligence, University of Szeged, Hungary, Hungary;Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria
Venue:
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Year:
2006

Citing 7
Cited 3

Backtrack Programming

Journal of the ACM (JACM)
New methods to color the vertices of a graph

Communications of the ACM
Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993

Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Where the really hard problems are

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Heuristic colour assignment strategies for merge models in graph colouring

EvoCOP'05 Proceedings of the 5th European conference on Evolutionary Computation in Combinatorial Optimization
Comparing evolutionary algorithms on binary constraint satisfaction problems

IEEE Transactions on Evolutionary Computation

Parameter adjustment for genetic algorithm for two-level hierarchical covering location problem

WSEAS Transactions on Computers
Computing the metric dimension of graphs by genetic algorithms

Computational Optimization and Applications
Graph colouring heuristics guided by higher order graph properties

EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.