Institutional Repository
| A parallel shortest path algorithm based on graph-partitioning and iterative correcting | |
| Yuxin Tang; Yunquan Zhang; Hu Chen | |
| 2009 | |
| Source | Computer Systems Science & Engineering
 |
| Volume | 24Issue:5Pages:351-360 |
| Indexed Type | 其他 |
| Cooperation Status | 其它 |
| Keyword | Parallel Shortest Path Algorithm Intelligent Transportation Paralle Computing Gragp Partitioning |
| Language | 中文 |
| WOS ID | WOS:000277952300007 |
| Citation statistics | |
| Content Type | 期刊论文 |
| URI | http://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） | 开放获取 | License | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment