An analysis of solution properties of the graph coloring problem

Authors:
Jean-Philippe Hamiez;Jin-Kao Hao
Affiliations:
LGI2P, École des Mines d'Alès (site EERIE), Parc Scientifique Georges Besse, F-30035 Nîmes CEDEX 01, France;LERIA, Université d'Angers (U.F.R. des Sciences), 2, Boulevard Lavoisier, F-49045 Angers CEDEX 01, France
Venue:
Metaheuristics
Year:
2004

Citing 16
Cited 1

Using tabu search techniques for graph coloring

Computing
Codes and cryptography

Codes and cryptography
Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
A still better performance guarantee for approximate graph coloring

Information Processing Letters
Local optima topology for the k-coloring problem

Discrete Applied Mathematics - Special volume: viewpoints on optimization
Phase transitions and the search problem

Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
Boosting combinatorial search through randomization

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
On the hardness of approximating minimization problems

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
Tabu Search

Tabu Search
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A New Genetic Local Search Algorithm for Graph Coloring

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Search in a Small World

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Scatter Search for Graph Coloring

Selected Papers from the 5th European Conference on Artificial Evolution
Search on high degree graphs

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1

A search space "cartography" for guiding graph coloring heuristics

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper concerns the analysis of solution properties of the Graph Coloring Problem. For this purpose, we introduce a property based on the notion of representative sets which are sets of vertices that are always colored the same in a set of solutions. Experimental results on well-studied DIMACS graphs show that many of them contain such sets and give interesting information about the diversity of the solutions. We also show how such an analysis may be used to improve a tabu search algorithm.