ISCAS OpenIR  > 并行软件与计算科学实验室 
A parallel shortest path algorithm based on graph-partitioning and iterative correcting
Yuxin Tang; Yunquan Zhang; Hu Chen
2009
SourceComputer Systems Science & Engineering
Volume24Issue:5Pages:351-360
Indexed Type其他
Cooperation Status其它
KeywordParallel Shortest Path Algorithm Intelligent Transportation Paralle Computing Gragp Partitioning
Language中文
WOS IDWOS:000277952300007
Citation statistics
Content Type期刊论文
URIhttp://ir.iscas.ac.cn/handle/311060/1376
Collection并行软件与计算科学实验室 
Recommended Citation
GB/T 7714
Yuxin Tang,Yunquan Zhang,Hu Chen. A parallel shortest path algorithm based on graph-partitioning and iterative correcting[J]. Computer Systems Science & Engineering,2009,24(5):351-360.
APA Yuxin Tang,Yunquan Zhang,&Hu Chen.(2009).A parallel shortest path algorithm based on graph-partitioning and iterative correcting.Computer Systems Science & Engineering,24(5),351-360.
MLA Yuxin Tang,et al."A parallel shortest path algorithm based on graph-partitioning and iterative correcting".Computer Systems Science & Engineering 24.5(2009):351-360.
Files in This Item:
File Name/Size DocType Version Access License
zx94322964_01.pdf(743KB) 开放获取LicenseApplication Full Text
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Yuxin Tang]'s Articles
[Yunquan Zhang]'s Articles
[Hu Chen]'s Articles
Baidu academic
Similar articles in Baidu academic
[Yuxin Tang]'s Articles
[Yunquan Zhang]'s Articles
[Hu Chen]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Yuxin Tang]'s Articles
[Yunquan Zhang]'s Articles
[Hu Chen]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.