E. W. Dijkstra, A note on two problems in connexion with graphs Numerische mathematik, pp.269-271, 1959.

J. Leskovec, D. Huttenlocher, and J. Kleinberg, Predicting positive and negative links in online social networks, Proceedings of the 19th international conference on World wide web, WWW '10, pp.641-650, 2010.
DOI : 10.1145/1772690.1772756

J. Bruggeman, Evolution of run times with respect to the number of vertices Three implementations are compared: our two implementations -with and without using external memory -and a distributed Dijkstra implementation referred to as CPU Dijkstra. All computations were run on 64 cluster nodes Community detection in networks with positive and negative links, Physical Review E, vol.8, issue.80 3, p.36115, 2009.

K. Inoue, A. Doncescu, and H. Nabeshima, Hypothesizing about Causal Networks with Positive and Negative Effects by Meta-level Abduction, Inductive Logic Programming, pp.114-129, 2011.
DOI : 10.1007/978-3-642-21295-6_15

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

A. Buluç, J. R. Gilbert, and C. Budak, Solving path problems on the GPU, Parallel Computing, vol.36, issue.5-6, pp.241-253, 2010.
DOI : 10.1016/j.parco.2009.12.002

T. Okuyama, F. Ino, and K. Hagihara, A task parallel algorithm for finding all-pairs shortest paths using the GPU, International Journal of High Performance Computing and Networking, vol.7, issue.2, pp.87-98, 2012.
DOI : 10.1504/IJHPCN.2012.046384

K. Matsumoto, N. Nakasato, and S. G. Sedukhin, Blocked United Algorithm for the All-Pairs Shortest Paths Problem on Hybrid CPU-GPU Systems, IEICE Transactions on Information and Systems, vol.95, issue.12, pp.2759-2768, 2012.
DOI : 10.1587/transinf.E95.D.2759

H. Ortega-arranz, Y. Torres, D. R. Llanos, and A. Gonzalez-escribano, The all-pair shortest-path problem in sharedmemory heterogeneous systems, 2013.

G. Karypis and V. Kumar, Parallel multilevel k-way partitioning scheme for irregular graphs, Proceedings of the 1996 ACM/IEEE conference on Supercomputing (CDROM) , Supercomputing '96, pp.96-129, 1998.
DOI : 10.1145/369028.369103

M. Snir, S. W. Otto, D. W. Walker, J. Dongarra, and S. Huss-lederman, MPI: the complete reference, 1995.

V. Volkov, Better performance at lower occupancy, Proceedings of the GPU Technology Conference, 2010.

K. Mehlhorn, S. Näher, and C. Uhrig, Leda: A platform for combinatorial and geometric computing, 1999.

G. P. Pezzi, M. C. Cera, E. Mathias, and N. Maillard, Online scheduling of mpi-2 programs with hierarchical work stealing, Computer Architecture and High Performance Computing SBAC-PAD 2007. 19th International Symposium on. IEEE, pp.247-254, 2007.

B. Dawes, D. Abrahams, and R. Rivera, Boost c++ libraries, p.36, 2009.