QQ客服 官方微博 反馈留言

	All-pairs shortest path algorithm based on MPI+CUDA distributed parallel programming model
	Wu, Qingshuang; Tong, Chunya; Wang, Qiang; Cheng, Xiangfu
刊名	Journal of Networks
	2013
卷号	8期号:12页码:2797-2803
ISSN号	1796-2056
DOI	10.4304/jnw.8.12.2797-2803
URL标识	查看原文
WOS记录号	EI:20135117100739
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/5256772
专题	湖南城市学院
作者单位	[Wu, Qingshuang] College of Territorial Resources and Tourism, Anhui Normal University, Wuhu, Anhui, 241003, China
推荐引用方式 GB/T 7714	Wu, Qingshuang,Tong, Chunya,Wang, Qiang,et al. All-pairs shortest path algorithm based on MPI+CUDA distributed parallel programming model[J]. Journal of Networks,2013,8(12):2797-2803.
APA	Wu, Qingshuang,Tong, Chunya,Wang, Qiang,&Cheng, Xiangfu.(2013).All-pairs shortest path algorithm based on MPI+CUDA distributed parallel programming model.Journal of Networks,8(12),2797-2803.
MLA	Wu, Qingshuang,et al."All-pairs shortest path algorithm based on MPI+CUDA distributed parallel programming model".Journal of Networks 8.12(2013):2797-2803.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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