| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652788 | Electronic Notes in Discrete Mathematics | 2010 | 8 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
