QQ客服 官方微博 反馈留言

	Circuit Decompositions and Shortest Circuit Coverings of Hypergraphs
	Kang, Liying[1]; Lu, Weihua[2]; Wu, Yezhou[3]; Ye, Dong[4]; Zhang, Cun-Quan[5]
刊名	GRAPHS AND COMBINATORICS
	2018
卷号	34页码:365-372
关键词	Hypergraph Circuit decomposition Circuit cover
ISSN号	0911-0119
URL标识	查看原文
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/2179676
专题	上海大学
作者单位	1.[1]Shanghai Univ, Dept Math, Shanghai 200444, Peoples R China. 2.[2]Shanghai Maritime Univ, Coll Arts & Sci, Shanghai 201306, Peoples R China. 3.[3]Zhejiang Univ, Ocean Coll, Zhoushan 316021, Zhejiang, Peoples R China. 4.[4]Middle Tennessee State Univ, Dept Math Sci, Murfreesboro, TN 37132 USA.,Middle Tennessee State Univ, Ctr Computat Sci, Murfreesboro, TN 37132 USA. 5.[5]West Virginia Univ, Dept Math, Morgantown, WV 26506 USA.
推荐引用方式 GB/T 7714	Kang, Liying[1],Lu, Weihua[2],Wu, Yezhou[3],et al. Circuit Decompositions and Shortest Circuit Coverings of Hypergraphs[J]. GRAPHS AND COMBINATORICS,2018,34:365-372.
APA	Kang, Liying[1],Lu, Weihua[2],Wu, Yezhou[3],Ye, Dong[4],&Zhang, Cun-Quan[5].(2018).Circuit Decompositions and Shortest Circuit Coverings of Hypergraphs.GRAPHS AND COMBINATORICS,34,365-372.
MLA	Kang, Liying[1],et al."Circuit Decompositions and Shortest Circuit Coverings of Hypergraphs".GRAPHS AND COMBINATORICS 34(2018):365-372.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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