中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
a parallel shortest path algorithm based on graph-partitioning and iterative correcting

文献类型:会议论文

作者Tang Yuxin ; Zhang Yunquan ; Chen Hu
出版日期2008
会议名称10th IEEE International Conference on High Performance Computing and Communications
会议日期SEP 25-27,
会议地点Dalian, PEOPLES R CHINA
关键词parallel shortest path algorithm intelligent transportation parallel computing graph partitioning
页码155-161
英文摘要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
会议主办者IEEE, TCSC IEEE, IEEE Comp Soc
会议录Proceedings - 10th IEEE International Conference on High Performance Computing and Communications, HPCC 2008
会议录出版者HPCC 2008: 10TH IEEE INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS, PROCEEDINGS
会议录出版地10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN号978-0-7695-3352-0
源URL[http://124.16.136.157/handle/311060/10708]  
专题软件研究所_并行计算实验室 _会议论文
推荐引用方式
GB/T 7714
Tang Yuxin,Zhang Yunquan,Chen Hu. a parallel shortest path algorithm based on graph-partitioning and iterative correcting[C]. 见:10th IEEE International Conference on High Performance Computing and Communications. Dalian, PEOPLES R CHINA. SEP 25-27,.

入库方式: OAI收割

来源:软件研究所

浏览0
下载0
收藏0
其他版本

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