A parallel shortest path algorithm based on graph-partitioning and iterative correcting | |
Yuxin Tang ; Yunquan Zhang ; Hu Chen | |
刊名 | Computer Systems Science & Engineering
![]() |
2009 | |
卷号 | 24期号:5页码:351-360 |
关键词 | parallel shortest path algorithm intelligent transportation paralle computing gragp partitioning |
合作状况 | 其它 |
收录类别 | 其他 |
语种 | 中文 |
WOS记录号 | WOS:000277952300007 |
公开日期 | 2010-05-14 |
内容类型 | 期刊论文 |
源URL | [http://124.16.136.157/handle/311060/1376] ![]() |
专题 | 软件研究所_并行计算实验室 _期刊论文 |
推荐引用方式 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. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论