An exact method for graph coloring

Authors:
C. Lucet;F. Mendes;A. Moukrim
Affiliations:
LaRIA FRE, Amiens, France;LaRIA FRE, Amiens, France;HeuDiaSyC UMR CNRS UTC, BP Compiègne, France
Venue:
Computers and Operations Research
Year:
2006

Citing 10
Cited 3

A generalized implicit enumeration algorithm for graph coloring

Communications of the ACM - Lecture notes in computer science Vol. 174
Complexity of finding embeddings in a k-tree

SIAM Journal on Algebraic and Discrete Methods
Using tabu search techniques for graph coloring

Computing
A decomposition algorithm for network reliability evaluation

Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
On a multiconstrained model for chronmatic scheduling

Proceedings of the third international conference on Graphs and optimization
New methods to color the vertices of a graph

Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Finding the chromatic number by means of critical graphs

Journal of Experimental Algorithmics (JEA)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Combinatorial optimization in system configuration design

Automation and Remote Control
Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts

Computers and Operations Research
A New Ant Colony Optimization Algorithm for the Lower Bound of Sum Coloring Problem

Journal of Mathematical Modelling and Algorithms

Quantified Score

Hi-index	0.01

Visualization

Abstract

We are interested in the graph coloring problem. We propose an exact method based on a linear-decomposition of the graph. The complexity of this method is exponential according to the linearwidth of the entry graph, but linear according to its number of vertices. We present some experiments performed on literature instances, among which COLOR02 library instances. Our method is useful to solve more quickly than other exact algorithms instances with small linearwidth, such as mug graphs. Moreover, our algorithms are the first to our knowledge to solve the COLOR02 instance 4-Inser_3 with an exact method.