Name
Abstract | ||
|---|---|---|
In this paper we present our study of the minimum sum coloring problem (MSCP). We propose a general lower bound for MSCP based on extraction of specific partial graphs. Also, we propose a lower bound using some decomposition into cliques. The experimental results show that our approach improves the results for most literature instances. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.endm.2010.05.084 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
Minimum Sum Coloring,Lower Bounds,Heuristics | Graph,Discrete mathematics,Complete coloring,Combinatorics,Upper and lower bounds,Heuristics,Mathematics,Coloring problem | Journal |
Volume | ISSN | Citations |
36 | 1571-0653 | 11 |
PageRank | References | Authors |
0.58 | 8 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. Moukrim | 1 | 20 | 1.14 |
| K. Sghiouer | 2 | 11 | 0.58 |
| Corinne Lucet | 3 | 99 | 8.51 |
| Yu Li | 4 | 101 | 5.28 |