article · Geography and Geo-Information Science · 2013
An Analysis of Parallelizing Shortest Path Algorithm
Cited by 2Abstract and details only
Abstract
Familiar parallelization shortest path algorithms focus on single source multiple sinks or multiple sources multiple sinks problems,but less is capable to query shortest path of single source single sink problem.Parallelizing shortest path methods based on parallelization Boost library,network partition and bidirectional search are approached in this paper.An experiment using road network data on DIMAS is done.The result indicates that bidirectional search parallelization algorithm is effective and consuming time of this algorithm is twenty-five to fifty percent of serial Dijkstra algorithm.
Cite this paper
He, J. (2013). An Analysis of Parallelizing Shortest Path Algorithm. Geography and Geo-Information Science.
He, Junfang. “An Analysis of Parallelizing Shortest Path Algorithm.” Geography and Geo-Information Science, 2013.
He, Junfang. 2013. “An Analysis of Parallelizing Shortest Path Algorithm.” Geography and Geo-Information Science.
He, J. (2013) ‘An Analysis of Parallelizing Shortest Path Algorithm’, Geography and Geo-Information Science.
@article{he2013analysis,
title = {{An Analysis of Parallelizing Shortest Path Algorithm}},
author = {He, Junfang},
journal = {Geography and Geo-Information Science},
year = {2013}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.