Fast minimum spanning tree for large graphs on the GPU

@inproceedings{Vineet2009FastMS,
  title={Fast minimum spanning tree for large graphs on the GPU},
  author={Vibhav Vineet and Pawan Harish and Suryakant Patidar and P. J. Narayanan},
  booktitle={High Performance Graphics},
  year={2009}
}
Graphics Processor Units are used for many general purpose processing due to high compute power available on them. Regular, data-parallel algorithms map well to the SIMD architecture of current GPU. Irregular algorithms on discrete structures like graphs are harder to map to them. Efficient data-mapping primitives can play crucial role in mapping such algorithms onto the GPU. In this paper, we present a minimum spanning tree algorithm on Nvidia GPUs under CUDA, as a recursive formulation of Bor… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 75 CITATIONS, ESTIMATED 35% COVERAGE

213 Citations

02040'10'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 213 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…