.png){kind=icon}
返回
A solution-driven multilevel approach for graph coloring
.png){kind=icon}
OA
AI
DOI：10.1016/j.asoc.2021.107174.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Graph coloring is one of the most studied NP-hard problems with a wide range of applications. In this work, the first solution-driven multilevel algorithm for this computationally challenging problem is investigated. Following the general idea of multilevel optimization, the proposed algorithm combines an original solution-driven coarsening procedure with an uncoarsening procedure as well as an effective refinement procedure. The algorithm is assessed on 47 popular DIMACS and COLOR benchmark graphs, and compared with 13 state-of-the-art coloring methods in the literature. We close one large graph (wap01a.col) by providing its chromatic number for the first time. Impacts of the key ingredients of the algorithm are also investigated. (c) 2021 Elsevier B.V. All rights reserved.
Keyword:
Multilevel optimization
Heuristics
k-graph coloring
Tabu search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容