a parallel shortest path algorithm based on graph-partitioning and     iterative correcting

	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
会议录名称	Proceedings - 10th IEEE International Conference on High Performance Computing and Communications, HPCC 2008
页码	155-161
会议日期	SEP 25-27,
会议地点	Dalian, PEOPLES R CHINA
出版地	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
ISBN	978-0-7695-3352-0
部门归属	Tang, Yuxin; Zhang, Yunquan; Chen, Hu Chinese Acad Sci, Inst Software, Lab Parallel Comp, Beijing 100864, Peoples R China.
摘要	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
关键词	Parallel Shortest Path Algorithm Intelligent Transportation Parallel Computing Graph Partitioning
主办者	IEEE, TCSC IEEE, IEEE Comp Soc
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/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]. 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.

条目包含的文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
04637692.pdf（537KB）			开放获取	--	请求全文