alihadian / ROLLLinks
ROLL: Fast In-Memory Generation of Gigantic Scale-free Networks
☆11Updated 8 years ago
Alternatives and similar repositories for ROLL
Users that are interested in ROLL are comparing it to the libraries listed below
Sorting:
- For benchmaring community detection algorithms on social networks with meta-data☆17Updated 10 years ago
- A graph processing engine for hybrid CPU and GPU platforms☆38Updated 6 years ago
- Webgraph++ code (http://cnets.indiana.edu/groups/nan/webgraph/)☆31Updated 11 months ago
- A Lightweight Graph Processing Framework for Multi-GPUs☆14Updated 10 years ago
- Hybrid methods for Parallel Betweenness Centrality on the GPU☆24Updated 6 years ago
- ☆43Updated 2 years ago
- Comparison of graph processing systems.☆23Updated 8 years ago
- CuSha is a CUDA-based vertex-centric graph processing framework that uses G-Shards and CW representations.☆52Updated 9 years ago
- A graph application benchmark suite☆21Updated 10 years ago
- WebGraph framework with extensions☆23Updated 10 years ago
- Master's thesis project involving label-constrained reachability (LCR)☆1Updated 4 years ago
- Chaos: Scale-out Graph Processing from Secondary Storage☆50Updated 9 years ago
- Edge-centric Graph Processing System using Streaming Partitions☆82Updated 7 years ago
- Frog is Asynchronous Graph Processing on GPU with Hybrid Coloring Model. The fundamental idea is based on Pareto principle (or 80-20 rule…☆36Updated 4 years ago
- Benchmarking various graph databases, engines, datastructures, and data stores.☆37Updated 11 years ago
- Scalable Graph Mining☆62Updated 2 years ago
- GraphMat graph analytics framework☆102Updated 2 years ago
- CP 2015 subgraph isomorphism experiments, data and paper☆13Updated 9 years ago
- Medusa: Building GPU-based Parallel Sparse Graph Applications with Sequential C/C++ Code☆62Updated 4 years ago
- Personalized PageRank Algorithm described in the paper "FAST-PPR: Scaling Personalized PageRank Estimation for Large Graphs"☆36Updated 10 years ago
- The ParSeMiS project (Parallel and Sequential Graph Mining Suite) searches for frequent, interesting substructures in graph databases. ht…☆44Updated 5 years ago
- Python Benchmarking Framework for the Clustering Algorithms Evaluation: networks generation and shuffling; failover execution and resourc…☆19Updated 6 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 6 years ago
- Algorithms to list k-cliques in real-world graphs☆26Updated 4 years ago
- Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"☆24Updated 9 years ago
- ☆28Updated 2 months ago
- A NUMA-aware Graph-structured Analytics Framework☆44Updated 6 years ago
- A subgraph enumeration framework☆14Updated 7 years ago
- MPI+OpenMP implementation of Louvain method for Graph Community Detection, with a number of parallel heuristics/approximate computing tec…☆27Updated this week
- A C++ Pregel Clone with dynamic load balancing, based on a paper "Mizan: A System for Dynamic Load Balancing in Large-scale Graph Process…☆27Updated 11 years ago