.png){kind=icon}
返回
A DSATUR-based algorithm for the Equitable Coloring Problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2014.11.014.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper describes a new exact algorithm for the Equitable Coloring Problem, a coloring problem where the sizes of two arbitrary color classes differ in at most one unit. Based on the well known DSATUR algorithm for the classic Coloring Problem, a pruning criterion arising from equity constraints is proposed and analyzed. The good performance of the algorithm is shown through computational experiments over random and benchmark instances. (C) 2014 Elsevier Ltd. All rights reserved.
Keyword:
Equitable coloring
DSATUR
Exact algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
DNN based approach to classify Covid’19 using convolutional neural network and transfer learning
PREAI
分享收藏Sublethal Effects of Four Insecticides on the Seven-Spotted Lady Beetle (Coleoptera: Coccinellidae)
PREAI
分享收藏分享收藏
查看更多内容