MPI implementation of a parallel algorithm for finding the exact number of triangles in massive networks
-
Updated
Oct 28, 2016 - C++
MPI implementation of a parallel algorithm for finding the exact number of triangles in massive networks
A Parallel Graphlet Decomposition Library for Large Graphs
Accelerating All-Edge Common Neighbor Counting on Three Processors (ICPP'19) - By Yulin Che, Zhuohang Lai, Shixuan Sun, Prof. Qiong Luo and Yue Wang
Parallel Kronecker Binary EdgeList (*.bin) To CSR (Lijun Chang's Format: b_adj.bin, b_degree.bin), Graph Statistics: Parallel TC/Core/DODG Analytics
Count triangles that graph nodes form, in a parallel program.
Vertex Ordering to List Triangles: a fast C++ tool for triangle counting or listing in big graphs. See associated paper: https://arxiv.org/abs/2203.04774
A framework for implementing graph algorithms in SYCL.
GraphMat graph analytics framework
The official code for DATE'23 paper <CLAP: Locality Aware and Parallel Triangle Counting with Content Addressable Memory>
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."