QQ客服 官方微博 反馈留言

	A linear-time algorithm for clique-coloring problem in circular-arc graphs
	Liang, Zuosong[1]; Shan, Erfang[2]; Zhang, Yuzhong[3]
刊名	JOURNAL OF COMBINATORIAL OPTIMIZATION
	2017
卷号	33页码:147-155
关键词	Clique-coloring Circular-arc graph Linear time algorithm
ISSN号	1382-6905
URL标识	查看原文
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/2192904
专题	上海大学
作者单位	1.[1]Qufu Normal Univ, Sch Management, Rizhao 276800, Peoples R China. 2.[2]Shanghai Univ, Sch Management, Shanghai 200444, Peoples R China.,Shanghai Univ, Dept Math, Shanghai 200444, Peoples R China. 3.[3]Qufu Normal Univ, Sch Management, Rizhao 276800, Peoples R China.
推荐引用方式 GB/T 7714	Liang, Zuosong[1],Shan, Erfang[2],Zhang, Yuzhong[3]. A linear-time algorithm for clique-coloring problem in circular-arc graphs[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION,2017,33:147-155.
APA	Liang, Zuosong[1],Shan, Erfang[2],&Zhang, Yuzhong[3].(2017).A linear-time algorithm for clique-coloring problem in circular-arc graphs.JOURNAL OF COMBINATORIAL OPTIMIZATION,33,147-155.
MLA	Liang, Zuosong[1],et al."A linear-time algorithm for clique-coloring problem in circular-arc graphs".JOURNAL OF COMBINATORIAL OPTIMIZATION 33(2017):147-155.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。