Alternatives and similar repositories for scc:

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

• iesl / grinch
  Scalable Hierarchical Clustering with Tree Grafting
  ☆28Updated 2 years ago
• GemsLab / StrucEmbedding-GraphLibrary
  The SEMB library is an easy-to-use tool for getting and evaluating structural node embeddings in graphs.
  ☆16Updated 2 years ago
• benedekrozemberczki / FEATHER
  The reference implementation of FEATHER from the CIKM '20 paper "Characteristic Functions on Graphs: Birds of a Feather, from Statistical…
  ☆50Updated 2 years ago
• palash1992 / GEM-Benchmark
  Benchmark for Graph Embedding Methods
  ☆47Updated 4 years ago
• vermaMachineLearning / FGSD
  Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).
  ☆24Updated 5 years ago
• kd383 / NetworkDOS
  Network Density of States (https://arxiv.org/abs/1905.09758) (KDD 2019)
  ☆25Updated 5 years ago
• samihaija / isvd
  Official implementation of NeurIPS'21: Implicit SVD for Graph Representation Learning
  ☆20Updated 3 years ago
• benedekrozemberczki / RolX
  An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)
  ☆70Updated 2 years ago
• daokunzhang / attri2vec
  code for paper "Attributed Network Embedding via Subspace Discovery"
  ☆21Updated 6 years ago
• TheGravLab / A-Unifying-Framework-for-Spectrum-Preserving-Graph-Sparsification-and-Coarsening
  Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)
  ☆16Updated 4 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆34Updated 4 years ago
• twitter-research / feature-propagation
  ☆82Updated 2 years ago
• DEEP-PolyU / GraphRNA_KDD19
  Graph Recurrent Networks with Attributed Random Walks
  ☆28Updated last year
• Matrix-Factorization-Bandit / IMFB-KDD2019
  Code for the experiments of Matrix Factorization Bandit
  ☆24Updated 6 years ago
• asn32 / weighted-nmf
  wNMF: Weighted Non-Negative Matrix Factorization
  ☆15Updated last year
• KyuhanLee / SSumM
  SSumM: Sparse Summarization of Massive Graphs
  ☆19Updated 4 years ago
• shenyangHuang / LAD
  Laplacian Change Point Detection for Dynamic Graphs (KDD 2020)
  ☆27Updated last year
• giannisnik / k-clique-graphs-dense-subgraphs
  ☆15Updated 8 years ago
• minjiyoon / KDD19-AnomRank
  Anomaly Detection in Dynamic Graphs
  ☆32Updated last year
• thelahunginjeet / pyrankagg
  pure python code for rank aggregation/voting
  ☆32Updated 3 years ago
• shuaiOKshuai / D2AGE
  The source codes for D2AGE model. Distance-aware DAG Embedding for Proximity Search on Heterogeneous Graphs.
  ☆12Updated 7 years ago
• meyerscetbon / LOT
  ☆17Updated 2 years ago
• ahollocou / walkscan
  Algorithms for local community detection in networks
  ☆26Updated 8 years ago
• a-lucic / cf-gnnexplainer
  ☆57Updated 2 years ago
• karl-zhao / benchmarking-gnns-pyg
  ☆30Updated 2 years ago
• rmgarnett / fast_wl
  A fast MATLAB implementation of the Weisfeiler--Lehman graph transformation and associated kernel.
  ☆11Updated 7 years ago
• edouardpineau / A-simple-baseline-algorithm-for-graph-classification
  Github page for the paper "A simple baseline algorithm for graph classification" presented at the R2L workshop of NIPS 2018
  ☆27Updated 4 years ago
• nikhil-dce / SBM-meet-GNN
  Implementation of SBM-meet-GNN
  ☆23Updated 5 years ago
• talwagner / fair_clustering
  ☆20Updated 5 years ago
• davidbuterez / gnn-neural-readouts
  ☆27Updated 3 months ago