GraphMat graph analytics framework
-
Updated
May 6, 2017 - C++
{{ message }}
GraphMat graph analytics framework
A Parallel Graphlet Decomposition Library for Large Graphs
Probably the first scalable and open source triangle count based on each edge, on scala and spark for every Big Dataset. (Louvain)
OpenMP-based parallel program for counting the number of triangles in a sparse graph
Drawing shapes are very easy, like <circle></circle> <square></square>
MPI implementation of a parallel algorithm for finding the exact number of triangles in massive networks
OpenGraph is an open-source graph processing benchmarking suite written in pure C/OpenMP.
A distributed algorithm applied to the bitcoin blockchain that allows to create a new representation of the transaction - a clusterized graph that combines all the addresses belonging to the same owner/organization.
A Scala Spark based project to experiment with map-reduce algorithms on big data graph shaped
Graph Processing Framework that supports || OpenMP || CAPI
OpenGraph is an open-source graph processing benchmarking suite written in pure C/OpenMP. Integrated with Sniper simulator.
Distributed Triangle Counting
Parallel Kronecker Binary EdgeList (*.bin) To CSR (Lijun Chang's Format: b_adj.bin, b_degree.bin), Graph Statistics: Parallel TC/Core/DODG Analytics
MapReduce approach to triangles count problem
Implementation of Triangle Counting Problem in Apache Spark
Accelerating All-Edge Common Neighbor Counting on Three Processors (ICPP'19) - By Yulin Che, Zhuohang Lai, Shixuan Sun, Prof. Qiong Luo and Yue Wang
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."