QQ客服 官方微博 反馈留言

	Algorithms for connected p-centdian problem on block graphs
	Kang, Liying[1]; Zhou, Jianjie[2]; Shan, Erfang[3]
刊名	JOURNAL OF COMBINATORIAL OPTIMIZATION
	2018
卷号	36页码:252-263
关键词	Connected p-center Median Centdian Block graphs
ISSN号	1382-6905
URL标识	查看原文
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/2174012
专题	上海大学
作者单位	1.[1]Shanghai Univ, Dept Math, Shanghai 200444, Peoples R China. 2.[2]Shanghai Univ, Dept Math, Shanghai 200444, Peoples R China. 3.[3]Shanghai Univ, Sch Management, Shanghai 200444, Peoples R China.
推荐引用方式 GB/T 7714	Kang, Liying[1],Zhou, Jianjie[2],Shan, Erfang[3]. Algorithms for connected p-centdian problem on block graphs[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION,2018,36:252-263.
APA	Kang, Liying[1],Zhou, Jianjie[2],&Shan, Erfang[3].(2018).Algorithms for connected p-centdian problem on block graphs.JOURNAL OF COMBINATORIAL OPTIMIZATION,36,252-263.
MLA	Kang, Liying[1],et al."Algorithms for connected p-centdian problem on block graphs".JOURNAL OF COMBINATORIAL OPTIMIZATION 36(2018):252-263.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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