-
63浏览
-
0点赞
-
0收藏
-
0分享
-
0下载
-
0评论
-
引用
期刊论文
Perfect Circular Arc Coloring
Journal of Combinatorial Optimization ,2005,9():267–280 | 2005年05月01日 | https://doi.org/10.1007/s10878-005-1411-x
The circular arc coloring problem is to find a minimum coloring of a set of arcs of a circle so that no two overlapping arcs share a color. This NP-hard problem arises in a rich variety of applications and has been studied extensively. In this paper we present an O(n2 m) combinatorial algorithm for optimally coloring any set of arcs that corresponds to a perfect graph, and propose a new approach to the general circular arc coloring problem.
学者未上传该成果的PDF文件,请等待学者更新
本学者其他成果
同领域成果