Accelerating large graph algorithms on GPU using CUDA
This paper presents the parallelisation of three fundamental class of graph problem - Breadth First Search, Single Source Shortest Path, and All-Pair Shortest Path, using CUDA based implementation on GPUs and examines the performance of the algorithms on a diverse set of generated and procured large graphs.