Perfect circular arc coloring
文献类型：期刊论文
| 作者 | Chen, XJ ; Hu, ZQ; Zang, WN
|
| 刊名 | JOURNAL OF COMBINATORIAL OPTIMIZATION
 |
| 出版日期 | 2005-05-01 |
| 卷号 | 9期号:3页码:267-280 |
| 关键词 | graph coloring circular-arc graph perfect graph matching complexity |
| ISSN号 | 1382-6905 |
| DOI | 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(n(2)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. |
| WOS研究方向 | Computer Science ; Mathematics |
| 语种 | 英语 |
| WOS记录号 | WOS:000230175400003 |
| 出版者 | SPRINGER |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/1539]  |
| 专题 | 应用数学研究所 |
| 通讯作者 | Zang, WN |
| 作者单位 | 1.Univ Hong Kong, Dept Math, Hong Kong, Hong Kong, Peoples R China 2.Acad Sinica, Inst Appl Math, Beijing 100080, Peoples R China 3.Cent China Normal Univ, Dept Math, Wuhan 430079, Peoples R China |
| 推荐引用方式 GB/T 7714 | Chen, XJ,Hu, ZQ,Zang, WN. Perfect circular arc coloring[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION,2005,9(3):267-280. |
| APA | Chen, XJ,Hu, ZQ,&Zang, WN.(2005).Perfect circular arc coloring.JOURNAL OF COMBINATORIAL OPTIMIZATION,9(3),267-280. |
| MLA | Chen, XJ,et al."Perfect circular arc coloring".JOURNAL OF COMBINATORIAL OPTIMIZATION 9.3(2005):267-280. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。