Increasing the efficiency of graph colouring algorithms with a representation based on vector operations (bibtex)

by I Juhos and van Hemert, J

Abstract:

We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of graph colouring algorithms. Moreover, this model provides useful information to aid in the creation of heuristics that can make the colouring process even faster. It also serves as a compact definition for the description of graph colouring algorithms. To verify the potential of the model, we use it in the complete algorithm DSATUR, and in two version of an incomplete approximation algorithm; an evolutionary algorithm and the same evolutionary algorithm extended with guiding heuristics. Both theoretical and empirical results are provided investigation is performed to show an increase in the efficiency of solving graph colouring problems. Two problem suites were used for the empirical evidence: a set of practical problem instances and a set of hard problem instances from the phase transition.

Reference:

Increasing the efficiency of graph colouring algorithms with a representation based on vector operations (I Juhos and van Hemert, J), In Journal of Software, volume 1, 2006.

Bibtex Entry:

@article{JH2006a, _day = {01}, abstract = {We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of graph colouring algorithms. Moreover, this model provides useful information to aid in the creation of heuristics that can make the colouring process even faster. It also serves as a compact definition for the description of graph colouring algorithms. To verify the potential of the model, we use it in the complete algorithm DSATUR, and in two version of an incomplete approximation algorithm; an evolutionary algorithm and the same evolutionary algorithm extended with guiding heuristics. Both theoretical and empirical results are provided investigation is performed to show an increase in the efficiency of solving graph colouring problems. Two problem suites were used for the empirical evidence: a set of practical problem instances and a set of hard problem instances from the phase transition.}, author = {I Juhos and van Hemert, J}, date-added = {2008-08-18 12:42:43 +0100}, date-modified = {2008-08-18 12:42:43 +0100}, journal = {Journal of Software}, keywords = {graph colouring; constraint satisfaction}, number = {2}, pages = {24--33}, pdf = {http://www.academypublisher.com/jsw/vol01/no02/jsw01022433.pdf}, title = {Increasing the efficiency of graph colouring algorithms with a representation based on vector operations}, volume = {1}, year = {2006}}

Powered by bibtexbrowser