QQ客服 官方微博 反馈留言

	Approximating the longest cycle problem on graphs with bounded degree (EI收录)
	Chen, Guantao[1]; Gao, Zhicheng[2]; Yu, Xingxing[3]; Zang, Wenan[4]
会议名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
会议日期	August 16, 2005 - August 19, 2005
会议地点	Kunming, China
关键词	Combinatorial mathematics
URL标识	查看原文
内容类型	会议论文
URI标识	http://www.corc.org.cn/handle/1471x/2117131
专题	华南理工大学
作者单位	1.[1] Department of Mathematics and Statistics, Georgia State University, Atlanta 2.GA, United States 3.[2] University of Macau, Macau, China 4.[3] School of Mathematics, Georgia Institute of Technology, Atlanta 5.GA, United States 6.[4] Department of Mathematics, University of Hong Kong, Hong Kong, China
推荐引用方式 GB/T 7714	Chen, Guantao[1],Gao, Zhicheng[2],Yu, Xingxing[3],等. Approximating the longest cycle problem on graphs with bounded degree (EI收录)[C]. 见:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Kunming, China. August 16, 2005 - August 19, 2005.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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