Parallel graph component labelling with GPUs and CUDA

DOI10.1016/j.parco.2010.07.002zbMath1213.68456OpenAlexW1968523623WikidataQ62042208 ScholiaQ62042208MaRDI QIDQ608854

D. P. Playne, K. A. Hawick, A. Leist

Publication date: 26 November 2010

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.parco.2010.07.002

zbMATH Keywords

meshCUDAGPUdata-parallel algorithmsgraph component labelling

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Data structures (68P05) Computer system organization (68M99)

Related Items (5)

Time-stepping methods for the simulation of the self-assembly of nano-crystals in MATLAB on a GPU ⋮ GPU-based single-cluster algorithm for the simulation of the Ising model ⋮ Entanglement entropy from non-equilibrium Monte Carlo simulations ⋮ Finite-size scaling in ferromagnetic spin systems on the pyrochlore lattice ⋮ Antimagicness of generalized corona and snowflake graphs

Uses Software

• CUDA

Cites Work

• From the Cover: The structure of scientific collaboration networks
• Emergence of Scaling in Random Networks
• New methods to color the vertices of a graph
• Collective dynamics of ‘small-world’ networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Parallel graph component labelling with GPUs and CUDA