Graph coarsening and clustering on the GPU

MaRDI QIDQ5298946zbMATH OpenFDO

Authors B. O. Fagginger Auer, R. H. Bisseling

Publication date 25 June 2013

zbMATH Keywords

agglomerative clusteringfine-grained shared-memory parallel graph coarsening algorithm

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Clustering in the social and behavioral sciences (91C20)

Recommendations

• Multilevel local search algorithms for modularity clustering
• Parallel community detection for massive graphs
• (Semi-)External Algorithms for Graph Partitioning and Clustering
• Parallel graph component labelling with GPUs and CUDA
• Rapid Multipole Graph Drawing on the GPU

Cited in

(4)

• Utilization of OpenCL for large graph problems on graphics processing unit
• Efficient approximation algorithms for weighted b-matching
• Tree-based coarsening and partitioning of complex networks
• Space-efficient graph coarsening with applications to succinct planar encodings

This page was built for publication: Graph coarsening and clustering on the GPU

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5298946)