QQ客服 官方微博 反馈留言

	Computing the point-to-point shortest path: Quotient space theory\'s application in complex network
	Zhao,Shu; Zhang,Yanping; He,Fugui; Zhang,Ling
刊名	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
	2010
页码	751-758
ISSN号	0302-9743
URL标识	查看原文
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/2198703
专题	安徽大学
作者单位	School of Computer Science and Technology,Anhui University, Hefei 230039, China
推荐引用方式 GB/T 7714	Zhao,Shu,Zhang,Yanping,He,Fugui,et al. Computing the point-to-point shortest path: Quotient space theory\'s application in complex network[J]. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),2010:751-758.
APA	Zhao,Shu,Zhang,Yanping,He,Fugui,&Zhang,Ling.(2010).Computing the point-to-point shortest path: Quotient space theory\'s application in complex network.Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),751-758.
MLA	Zhao,Shu,et al."Computing the point-to-point shortest path: Quotient space theory\'s application in complex network".Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010):751-758.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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