A Parallel Shortest Path Algorithm Based on Graph-Partitioning and Iterative Correcting

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 correcting is proposed. After evaluating the algorithm using three real road networks, we conclude that our graph… (More)
DOI: 10.1109/HPCC.2008.113

Topics

9 Figures and Tables

Statistics

01020201520162017
Citations per Year

Citation Velocity: 7

Averaging 7 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@article{Tang2008APS, title={A Parallel Shortest Path Algorithm Based on Graph-Partitioning and Iterative Correcting}, author={Yuxin Tang and Yunquan Zhang and Hu Chen}, journal={2008 10th IEEE International Conference on High Performance Computing and Communications}, year={2008}, pages={155-161} }