DAMA-UPC / SCDLinks
☆30Updated 8 years ago
Alternatives and similar repositories for SCD
Users that are interested in SCD are comparing it to the libraries listed below
Sorting:
- Scalable Graph Mining☆63Updated 2 years ago
- GraphChi's Java version☆238Updated last year
- LEMON: A local algorithm for fast, high-precision overlapping community detection☆55Updated 8 years ago
- *Experimental* GraphChi-DB graph database with computational capabilities☆79Updated 10 years ago
- Differentiated Computation and Partitioning on Skewed (Natural or Bipartite) Graphs☆67Updated 3 years ago
- FlashX is a collection of big data analytics tools that perform data analytics in the form of graphs and matrices.☆236Updated 5 years ago
- Graph Challenge☆32Updated 6 years ago
- GossipMap: distributed parallel community detection algorithm☆22Updated 10 years ago
- The STINGER in-memory graph store and dynamic graph analysis platform. Millions to billions of vertices and edges at thousands to millio…☆12Updated 9 years ago
- A graph application benchmark suite☆21Updated 10 years ago
- GraphMat graph analytics framework☆103Updated 2 years ago
- WebGraph framework with extensions☆23Updated 10 years ago
- Edge-centric Graph Processing System using Streaming Partitions☆82Updated 7 years ago
- Market Survey: Community Detection☆70Updated 8 years ago
- gBolt--very fast implementation for gSpan algorithm in data mining☆58Updated 4 years ago
- Dynamic Community Finding☆26Updated 7 years ago
- Webgraph++ code (http://cnets.indiana.edu/groups/nan/webgraph/)☆33Updated last year
- Large-scale ML & graph analytics on Giraph☆79Updated 9 years ago
- GraphChi's C++ version. Big Data - small machine.☆810Updated 6 years ago
- CuSha is a CUDA-based vertex-centric graph processing framework that uses G-Shards and CW representations.☆53Updated 9 years ago
- Generic driver for LDBC Graphalytics implementation☆85Updated 10 months ago
- Random Walk (Personalized PageRank) Algorithms for Large Graphs☆73Updated 9 years ago
- Out-of-core graph processing on a single machine.☆130Updated 7 years ago
- For benchmaring community detection algorithms on social networks with meta-data☆17Updated 11 years ago
- GraMi is a novel framework for frequent subgraph mining in a single large graph, GraMi outperforms existing techniques by 2 orders of ma…☆117Updated last year
- Python Benchmarking Framework for the Clustering Algorithms Evaluation: networks generation and shuffling; failover execution and resourc…☆19Updated 6 years ago
- Parallel Frequent Subgraph Mining☆30Updated 7 years ago
- MPI based distributed memory implementation of Louvain method for non overlapping community detecction☆28Updated 11 years ago
- Personalized PageRank Algorithm described in the paper "FAST-PPR: Scaling Personalized PageRank Estimation for Large Graphs"☆36Updated 11 years ago
- The STINGER in-memory graph store and dynamic graph analysis platform. Millions to billions of vertices and edges at thousands to millio…☆214Updated 9 months ago