Alternatives and similar repositories for scc

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

• kfoynt / LocalGraphClustering
  ☆144Updated 4 years ago
• kd383 / NetworkDOS
  Network Density of States (https://arxiv.org/abs/1905.09758) (KDD 2019)
  ☆25Updated 6 years ago
• georgehc / mnar_mc
  ☆12Updated 3 years ago
• iesl / grinch
  Scalable Hierarchical Clustering with Tree Grafting
  ☆28Updated 3 years ago
• asn32 / weighted-nmf
  wNMF: Weighted Non-Negative Matrix Factorization
  ☆18Updated 2 years ago
• xgfs / verse
  Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures
  ☆133Updated 4 years ago
• talwagner / fair_clustering
  ☆20Updated 6 years ago
• louisabraham / fastnode2vec
  Fast and scalable node2vec implementation
  ☆96Updated 2 years ago
• Dru-Mara / EvalNE
  Source code for EvalNE, a Python library for evaluating Network Embedding methods.
  ☆106Updated last year
• xgfs / NetLSD
  NetLSD descriptors for graphs. Compare and analyze graph structure on multiple levels!
  ☆60Updated 5 years ago
• kerighan / graph-walker
  Fastest random walks generator on networkx graphs
  ☆75Updated 11 months ago
• fukien / BiANE
  Codes for our SIGIR'20 paper "BiANE: Bipartite Attributed Network Embedding".
  ☆15Updated last year
• abojchevski / graph2gauss
  Gaussian node embeddings. Implementation of "Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking".
  ☆177Updated 2 years ago
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆89Updated 6 years ago
• BorgwardtLab / WWL
  Wasserstein Weisfeiler-Lehman Graph Kernels
  ☆85Updated last year
• maxiaoba / GRAPE
  ☆142Updated 4 years ago
• nd7141 / AWE
  Compute graph embeddings via Anonymous Walk Embeddings
  ☆83Updated 7 years ago
• lukasjf / contrastive-gnn-explanation
  ☆19Updated 3 years ago
• Ashish7129 / Graph_Sampling
  Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.
  ☆163Updated 4 years ago
• egalimberti / polarized_communities
  Discovering Polarized Communities in Signed Networks
  ☆13Updated 6 years ago
• BorgwardtLab / GraphKernels
  A package for computing Graph Kernels
  ☆104Updated 2 years ago
• jajupmochi / graphkit-learn
  A python package for graph kernels, graph edit distances, and graph pre-image problem.
  ☆128Updated 4 months ago
• snap-stanford / deepsnap
  Python library assists deep learning on graphs
  ☆564Updated last year
• benedekrozemberczki / RolX
  An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)
  ☆69Updated 2 years ago
• asajadi / fast-pagerank
  Fast (Personalized) PageRank Implementation
  ☆69Updated 2 years ago
• yzhao062 / data-mining-conferences
  Ranking, acceptance rate, deadline, and publication tips
  ☆336Updated 4 years ago
• snap-stanford / neural-subgraph-learning-GNN
  ☆362Updated last year
• krishnanlab / PecanPy
  A fast, parallelized, memory efficient, and cache-optimized Python implementation of node2vec
  ☆171Updated this week
• VHRanger / CSRGraph
  A tiny library for larger graphs
  ☆119Updated last year
• CUAI / CorrectAndSmooth
  [ICLR 2021] Combining Label Propagation and Simple Models Out-performs Graph Neural Networks (https://arxiv.org/abs/2010.13993)
  ☆292Updated 4 years ago