Name
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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.cor.2005.01.008 | Computers & OR |
Keywords | DocType | Volume |
Linear-decomposition,exact algorithms instance,exact method,Exact method,COLOR02 instance,Linearwidth,COLOR02 library instance,mug graph,Graph coloring,small linearwidth,graph coloring,literature instance,entry graph | Journal | 33 |
Issue | ISSN | Citations |
8 | Computers and Operations Research | 9 |
PageRank | References | Authors |
0.56 | 12 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Corinne Lucet | 1 | 99 | 8.51 |
| F. Mendes | 2 | 9 | 0.56 |
| A. Moukrim | 3 | 20 | 1.14 |