GraphMat graph analytics framework
-
Updated
Jan 25, 2023 - C++
GraphMat graph analytics framework
A Parallel Graphlet Decomposition Library for Large Graphs
MPI implementation of a parallel algorithm for finding the exact number of triangles in massive networks
Drawing shapes are very easy, like <circle></circle> <square></square>
Probably the first scalable and open source triangle count based on each edge, on scala and spark for every Big Dataset. (Louvain)
A Scala Spark based project to experiment with map-reduce algorithms on big data graph shaped
OpenMP-based parallel program for counting the number of triangles in a sparse graph
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.
Accelerating All-Edge Common Neighbor Counting on Three Processors (ICPP'19) - By Yulin Che, Zhuohang Lai, Shixuan Sun, Prof. Qiong Luo and Yue Wang
Implementation of Triangle Counting Problem in Apache Spark
Relationship prediction between nodes using Neo4J and Jupiter Notebook
Distributed Triangle Counting
A framework for implementing graph algorithms in SYCL.
Fast parallel triangle counting using OpenCilk, OpenMP, and Pthreads
Parallel Kronecker Binary EdgeList (*.bin) To CSR (Lijun Chang's Format: b_adj.bin, b_degree.bin), Graph Statistics: Parallel TC/Core/DODG Analytics
Mini Coding Project dari RevoU, yaitu membuat Program TriCalc. Program ini dapat membantu proses hitung luas dan keliling segitiga.
Count triangles that graph nodes form, in a parallel program.
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."