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:
- LEMON: A local algorithm for fast, high-precision overlapping community detection☆54Updated 7 years ago
- Scalable Graph Mining☆62Updated 2 years ago
- Dynamic Community Finding☆26Updated 7 years ago
- GossipMap: distributed parallel community detection algorithm☆22Updated 9 years ago
- ☆51Updated 8 years ago
- Python Benchmarking Framework for the Clustering Algorithms Evaluation: networks generation and shuffling; failover execution and resourc…☆19Updated 6 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆87Updated 6 years ago
- CoreScope: Graph Mining Using k-Core Analysis - Patterns, Anomalies and Algorithms (ICDM'16 & KAIS'18)☆16Updated 7 months ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 5 years ago
- DynaMo: Dynamic Community Detection by Incrementally Maximizing Modularity☆28Updated 3 years ago
- Market Survey: Community Detection☆70Updated 7 years ago
- MPI based distributed memory implementation of Louvain method for non overlapping community detecction☆28Updated 10 years ago
- Differentiated Computation and Partitioning on Skewed (Natural or Bipartite) Graphs☆66Updated 3 years ago
- Algorithms for local community detection in networks☆26Updated 8 years ago
- Network storage and analytics library☆27Updated 7 years ago
- The STINGER in-memory graph store and dynamic graph analysis platform. Millions to billions of vertices and edges at thousands to millio…☆11Updated 9 years ago
- Graph Challenge☆31Updated 5 years ago
- Large-scale ML & graph analytics on Giraph☆78Updated 9 years ago
- ☆8Updated 8 years ago
- Label Propagation based Community Detection algorithm implemented using multiprocessing module in python (Please have a look at my othe…☆9Updated 14 years ago
- Programs to identify link communities in complex networks☆96Updated 4 years ago
- A lightweight implementation of Walklets from "Don't Walk Skip! Online Learning of Multi-scale Network Embeddings" (ASONAM 2017).☆105Updated 2 years ago
- Jupyter notebooks for examples in the paper "Higher-order organization of complex networks".☆39Updated 7 years ago
- This is a sample implementation of "Asymmetric Transitivity Preserving Graph Embedding"(KDD 2016).☆17Updated 6 years ago
- For benchmaring community detection algorithms on social networks with meta-data☆17Updated 10 years ago
- FORA: Simple and Effective Approximate Single-Source Personalized Pagerank☆31Updated 4 years ago
- Graph kernels☆56Updated 3 years ago
- ☆12Updated 7 years ago
- Parallel Frequent Subgraph Mining☆31Updated 7 years ago
- Random Walk (Personalized PageRank) Algorithms for Large Graphs☆73Updated 9 years ago