A multi-threaded implementation of vertex-centric graph processing for CPUs.
-
Updated
Sep 24, 2015 - C++
A multi-threaded implementation of vertex-centric graph processing for CPUs.
Min-𝜖 Cosine 𝑘-Nearest Neighbor Graph Construction using Inverted Index Algorithm for CMPE255 Extra Credit Project at SJSU
Graph Reorder And Converter (e.g, Parallel OpenMP Implementation of Edge List to CSR with Sorted Neighbors) - by Yulin Che (https://github.com/CheYulin)
A Method for efficiently processing SpMV using SIMD and load balancing
A parallel packed CSR data structure for large-scale dynamic graphs
Comparison of PageRank algorithm using various datatypes.
Compute the graph minor when given the cluster configuration. Implemented in three versions using OpenMPI, pthreads and OpenCilk.
(R) Efficient methods and operators for the sparse matrix classes in 'Matrix' (esp. CSR format or "RsparseMatrix")
Add a description, image, and links to the csr topic page so that developers can more easily learn about it.
To associate your repository with the csr topic, visit your repo's landing page and select "manage topics."