Institutional Repository
| a parallel shortest path algorithm based on graph-partitioning and iterative correcting | |
| Tang Yuxin; Zhang Yunquan; Chen Hu | |
| 2008 | |
| Conference Name | 10th IEEE International Conference on High Performance Computing and Communications |
| Source | Proceedings - 10th IEEE International Conference on High Performance Computing and Communications, HPCC 2008 |
| Pages | 155-161 |
| Conference Date | SEP 25-27, |
| Conference Place | Dalian, PEOPLES R CHINA |
| Publish Place | 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA |
| Publisher | HPCC 2008: 10TH IEEE INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS, PROCEEDINGS |
| ISBN | 978-0-7695-3352-0 |
| Department | Tang, Yuxin; Zhang, Yunquan; Chen, Hu Chinese Acad Sci, Inst Software, Lab Parallel Comp, Beijing 100864, Peoples R China. |
| English Abstract | In this paper, we focus on satisfying the actual demands of quickly finding the shortest paths over real-road networks in an intelligent transportation system. A parallel shortest path algorithm based on graph partitioning and iterative correc |
| Keyword | Parallel Shortest Path Algorithm Intelligent Transportation Parallel Computing Graph Partitioning |
| Sponsorship | IEEE, TCSC IEEE, IEEE Comp Soc |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/10708 |
| Collection | 并行软件与计算科学实验室 |
| Recommended Citation GB/T 7714 | Tang Yuxin,Zhang Yunquan,Chen Hu. a parallel shortest path algorithm based on graph-partitioning and iterative correcting[C]. 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA:HPCC 2008: 10TH IEEE INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS, PROCEEDINGS,2008:155-161. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| 04637692.pdf（537KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment