R. Bellman, On a routing problem, Quarterly of Applied Mathematics, vol.16, issue.1, pp.87-90, 1958.
DOI : 10.1090/qam/102435

M. Burtscher, R. Nasre, and K. Pingali, A quantitative study of irregular programs on GPUs, 2012 IEEE International Symposium on Workload Characterization (IISWC), pp.141-151, 2012.
DOI : 10.1109/IISWC.2012.6402918

F. Busato and N. Bombieri, An Efficient Implementation of the Bellman-Ford Algorithm for Kepler GPU Architectures, IEEE Transactions on Parallel and Distributed Systems, vol.27, issue.8, pp.2222-2233, 2016.
DOI : 10.1109/TPDS.2015.2485994

A. Chaibou and O. Sie, Improving Global Performance on GPU for Algorithms with Main Loop Containing a Reduction Operation: Case of Dijkstra???s Algorithm, Journal of Computer and Communications, vol.03, issue.08, p.41, 2015.
DOI : 10.4236/jcc.2015.38005

A. Crauser, K. Mehlhorn, U. Meyer, and P. Sanders, A parallelization of Dijkstra's shortest path algorithm, International Symposium on Mathematical Foundations of Computer Science, pp.722-731, 1998.
DOI : 10.1007/BFb0055823

A. Davidson, S. Baxter, M. Garland, and J. D. Owens, Work-Efficient Parallel GPU Methods for Single-Source Shortest Paths, 2014 IEEE 28th International Parallel and Distributed Processing Symposium, pp.349-359, 2014.
DOI : 10.1109/IPDPS.2014.45

E. W. Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik, vol.4, issue.1, pp.269-271, 1959.
DOI : 10.1007/BF01386390

R. Farber, CUDA application design and development, 2011.

L. R. Ford-jr, Network flow theory, 1956.

P. Harish and P. Narayanan, Accelerating Large Graph Algorithms on the GPU Using CUDA, High performance computing?HiPC, pp.197-208, 2007.
DOI : 10.1007/978-3-540-77220-0_21

P. Harish, V. Vineet, and P. Narayanan, Large graph algorithms for massively multithreaded architectures. International Institute of Information Technology Hyderabad, Tech. Rep. IIIT/TR, vol.74, 2009.

F. Khorasani, K. Vora, R. Gupta, and L. N. Bhuyan, CuSha, Proceedings of the 23rd international symposium on High-performance parallel and distributed computing, HPDC '14, pp.239-252, 2014.
DOI : 10.1145/2600212.2600227

S. Kumar, A. Misra, and R. S. Tomar, A modified parallel approach to Single Source Shortest Path Problem for massively dense graphs using CUDA, 2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011), pp.635-639, 2011.
DOI : 10.1109/ICCCT.2011.6075214

D. Li and M. Becchi, Deploying Graph Algorithms on GPUs: An Adaptive Solution, 2013 IEEE 27th International Symposium on Parallel and Distributed Processing, pp.1013-1024, 2013.
DOI : 10.1109/IPDPS.2013.101

P. J. Martín, R. Torres, and A. Gavilanes, CUDA Solutions for the SSSP Problem, International Conference on Computational Science, pp.904-913, 2009.
DOI : 10.1007/978-3-642-01970-8_91

U. Meyer and P. Sanders, Delta-Stepping: A Parallel Single Source Shortest Path Algorithm, Proceedings of the 6th Annual European Symposium on Algorithms, ESA '98, pp.393-404, 1998.
DOI : 10.1007/3-540-68530-8_33

R. Nasre, M. Burtscher, and K. Pingali, Atomic-free irregular computations on GPUs, Proceedings of the 6th Workshop on General Purpose Processor Using Graphics Processing Units, GPGPU-6, pp.96-107, 2013.
DOI : 10.1145/2458523.2458533
URL : http://iss.ices.utexas.edu/Publications/Papers/nasre13-gpgpu.pdf

H. Ortega-arranz, Y. Torres, A. Gonzalez-escribano, and D. R. Llanos, Comprehensive Evaluation of a New GPU-based Approach to the Shortest Path Problem, International Journal of Parallel Programming, vol.54, issue.10, pp.918-938, 2015.
DOI : 10.1145/1951365.1951406

H. Ortega-arranz, Y. Torres, D. Llanos, and A. Gonzalez-escribano, A new GPUbased approach to the shortest path problem, High performance computing and simulation (HPCS), pp.505-511, 2013.

N. A. Sherwani, Algorithms for VLSI physical design automation, 2012.
DOI : 10.1007/978-1-4615-2351-2

S. Shirinivas, S. Vetrivel, and N. Elango, Applications of graph theory in computer science an overview, International Journal of Engineering Science and Technology, vol.2, issue.9, pp.4610-4621, 2010.

J. G. Siek, L. Lee, and A. Lumsdaine, The Boost Graph Library: User Guide and Reference Manual, Portable Documents, 2001.

D. P. Singh and N. Khare, Modified Dijkstra's algorithm for dense graphs on GPU using CUDA, Indian Journal of Science and Technology, vol.9, issue.33, p.2016

D. P. Singh, N. Khare, and A. , Efficient parallel implementation of single source shortest path algorithm on GPU using CUDA, International Journal of Applied Engineering Research, vol.11, issue.4, pp.2560-2567, 2016.

C. Sommer, Shortest-path queries in static networks, ACM Computing Surveys, vol.46, issue.4, p.45, 2014.
DOI : 10.1016/S0968-090X(97)00004-1

Y. Wang, A. Davidson, Y. Pan, Y. Wu, A. Riffel et al., Gunrock: A High-performance Graph Processing Library on the GPU, Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming , PPoPP '16, pp.1-1112, 2016.

J. Zhong and B. He, Medusa: Simplified Graph Processing on GPUs, IEEE Transactions on Parallel and Distributed Systems, vol.25, issue.6, pp.1543-1552, 2014.
DOI : 10.1109/TPDS.2013.111