OpenMP-based parallel program for counting the number of triangles in a sparse graph
-
Updated
Mar 28, 2018 - C
OpenMP-based parallel program for counting the number of triangles in a sparse graph
Fast parallel triangle counting using OpenCilk, OpenMP, and Pthreads
High performance triangle counting in large sparse graphs
This program implements Scalable Triangle Counting algorithm introduced by S.Acerm, A.Yasar, S.Rajamanickam, M.Wolf and U.Catalyurek.
OpenGraph is an open-source graph processing benchmarking suite written in pure C/OpenMP.
OpenGraph is an open-source graph processing benchmarking suite written in pure C/OpenMP. Integrated with Sniper simulator.
Add a description, image, and links to the triangle-counting topic page so that developers can more easily learn about it.
To associate your repository with the triangle-counting topic, visit your repo's landing page and select "manage topics."