[1]Dijkstra E W. A note on two problems in connexion with graphs[J]. Numerical Mathematics, 1959,1(1):269-271.
[2]Bellman R. On a routing problem[J]. Quarterly of Applied Mathematics, 1958,16(1):87-90.
[3]李平,李永树. 一种基于Dijkstra并行线程算法的研究与实现[J]. 测绘与空间地理信息, 2014(9):50-53.
[4]周益民,孙世新,田玲. 一种实用的所有点对之间最短路径并行算法[J]. 计算机应用, 2005,25(12):2921-2922.
[5]张文金,许爱军. 基于云计算的混合并行遗传算法求解最短路径[J]. 电子技术应用, 2015,41(3):123-125.
[6]刘欣,王非. 两种GPU上改进的最短路径算法[J]. 计算机应用研究, 2014,31(5):1407-1409.
[7]李寅,邓仰东. 基于GPU的混合式全源对最短路径算法研究[J]. 微电子学与计算机, 2016(2):77-82.
[8]王一同. GPU加速技术在图论算法中的应用[D]. 成都:电子科技大学, 2014.
[9]Aridhi S, Lacomme P, Ren L, et al. A MapReduce-based approach for shortest path problem in large-scale networks[J]. Engineering Applications of Artificial Intelligence, 2015,41(C):151-165.
[10]Wei-Kleiner F. Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs[J]. Journal of Computer and System Sciences, 2016,82(1):23-44.
[11]Djidjev H, Chapuis G, Andonov R, et al. All-pairs shortest path algorithms for planar graph for GPU-accelerated clusters[J]. Journal of Parallel and Distributed Computing, 2015,85(C):91-103.
[12]Ortega-Arranz H, TorresY, Gonzalez-Escribano A, et al. Comprehensive evaluation of a new GPU-based approach to the shortest path problem[J]. International Journal of Parallel Programming, 2015,43(5):918-938.
[13]Davidson A, Baxter S, Garland M, et al.Work-efficient parallel GPU methods for single-source shortest paths[C]// 2014 28th IEEE International Parallel and Distributed Processing Symposium. 2014:349-359.
[14]Akiba T, Iwatat Y, Kawarabayashi K, et al. Fast shortest-path distance queries on road networks by pruned highway labeling[C]// Proceedings of the 16th Workshop on Algorithm Engineering and Experiments (ALENEX). 2014:147-154. |