Alternatives and similar repositories for SCD:

Users that are interested in SCD are comparing it to the libraries listed below

• qcri / Arabesque
  Scalable Graph Mining
  ☆62Updated 2 years ago
• YixuanLi / LEMON
  LEMON: A local algorithm for fast, high-precision overlapping community detection
  ☆54Updated 7 years ago
• eXascaleInfolab / PyCABeM
  Python Benchmarking Framework for the Clustering Algorithms Evaluation: networks generation and shuffling; failover execution and resourc…
  ☆19Updated 6 years ago
• conradlee / network-community-benchmark
  For benchmaring community detection algorithms on social networks with meta-data
  ☆17Updated 10 years ago
• xvz / graph-processing
  Comparison of graph processing systems.
  ☆23Updated 7 years ago
• snap-stanford / ringo
  Next generation graph processing platform
  ☆12Updated 8 years ago
• realstolz / powerlyra
  Differentiated Computation and Partitioning on Skewed (Natural or Bipartite) Graphs
  ☆66Updated 3 years ago
• liyanghua / Label-Propagation
  Label Propagation based Community Detection algorithm implemented using multiprocessing module in python (Please have a look at my othe…
  ☆9Updated 14 years ago
• beginner1010 / butterfly-counting
  The source code for BUTTERFLY COUNTING IN BIPARTITE NETWORKS
  ☆12Updated 5 years ago
• uwescience / GossipMap
  GossipMap: distributed parallel community detection algorithm
  ☆22Updated 9 years ago
• plofgren / fast-ppr-scala
  Personalized PageRank Algorithm described in the paper "FAST-PPR: Scaling Personalized PageRank Estimation for Large Graphs"
  ☆35Updated 10 years ago
• Jokeren / gBolt
  gBolt--very fast implementation for gSpan algorithm in data mining
  ☆57Updated 3 years ago
• ahollocou / walkscan
  Algorithms for local community detection in networks
  ☆26Updated 8 years ago
• graphchallenge / GraphChallenge
  Graph Challenge
  ☆31Updated 5 years ago
• uwsampa / graphbench
  A graph application benchmark suite
  ☆21Updated 9 years ago
• lhelwerd / WebGraph
  WebGraph framework with extensions
  ☆23Updated 10 years ago
• kijungs / mzoom
  M-Zoom: Fast Dense-Block Detection in Tensors with Quality Guarantees (ECML/PKDD'16 & TKDD'18)
  ☆27Updated 6 months ago
• snap-stanford / snap-dev
  SNAP repository for Ringo
  ☆14Updated 7 years ago
• GraphChi / graphchi-java
  GraphChi's Java version
  ☆237Updated last year
• Lab41 / Circulo
  Community Detection Research Effort
  ☆79Updated 9 years ago
• maxdan94 / Density-Friendly
  C implementation of algorithms to find the Density-Friendly graph decomposition
  ☆11Updated 5 years ago
• Lab41 / survey-community-detection
  Market Survey: Community Detection
  ☆70Updated 7 years ago
• kijungs / corescope
  CoreScope: Graph Mining Using k-Core Analysis - Patterns, Anomalies and Algorithms (ICDM'16 & KAIS'18)
  ☆16Updated 6 months ago
• nogrady / dynamo
  DynaMo: Dynamic Community Detection by Incrementally Maximizing Modularity
  ☆28Updated 3 years ago
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆87Updated 6 years ago
• derekgreene / dynamic-community
  Dynamic Community Finding
  ☆26Updated 7 years ago
• GraphChi / graphchiDB-scala
  *Experimental* GraphChi-DB graph database with computational capabilities
  ☆79Updated 9 years ago
• Sotera / distributed-louvain-modularity
  Community Detection and Compression Analytic for Big Graph Data
  ☆37Updated 10 years ago
• bindscha / chaos
  Chaos: Scale-out Graph Processing from Secondary Storage
  ☆50Updated 9 years ago
• robmccoll / graphdb-testing
  Benchmarking various graph databases, engines, datastructures, and data stores.
  ☆37Updated 11 years ago