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
• louisabraham / fastnode2vec
  Fast and scalable node2vec implementation
  ☆97Updated 2 years ago
• iesl / grinch
  Scalable Hierarchical Clustering with Tree Grafting
  ☆28Updated 3 years ago
• thelahunginjeet / pyrankagg
  pure python code for rank aggregation/voting
  ☆31Updated 4 years ago
• shchur / overlapping-community-detection
  Implementation of "Overlapping Community Detection with Graph Neural Networks"
  ☆170Updated 5 years ago
• nd7141 / AWE
  Compute graph embeddings via Anonymous Walk Embeddings
  ☆83Updated 7 years ago
• xgfs / verse
  Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures
  ☆133Updated 4 years ago
• egalimberti / polarized_communities
  Discovering Polarized Communities in Signed Networks
  ☆13Updated 6 years ago
• VHRanger / CSRGraph
  A tiny library for larger graphs
  ☆119Updated last year
• 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
• asn32 / weighted-nmf
  wNMF: Weighted Non-Negative Matrix Factorization
  ☆18Updated 2 years ago
• xgfs / NetLSD
  NetLSD descriptors for graphs. Compare and analyze graph structure on multiple levels!
  ☆61Updated 5 years ago
• talwagner / fair_clustering
  ☆20Updated 6 years ago
• asajadi / fast-pagerank
  Fast (Personalized) PageRank Implementation
  ☆69Updated 2 years ago
• shenyangHuang / TGB
  Temporal Graph Benchmark project repo
  ☆237Updated last month
• pulearn / pulearn
  Positive-unlabeled learning with Python.
  ☆241Updated last week
• mvlearn / mvlearn
  Python package for multi-view machine learning
  ☆214Updated 2 years ago
• GemsLab / StrucEmbedding-GraphLibrary
  The SEMB library is an easy-to-use tool for getting and evaluating structural node embeddings in graphs.
  ☆18Updated 2 years ago
• aaronmcdaid / Overlapping-NMI
  ☆51Updated 9 years ago
• benedekrozemberczki / RolX
  An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)
  ☆69Updated 3 years ago
• abojchevski / graph2gauss
  Gaussian node embeddings. Implementation of "Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking".
  ☆177Updated 2 years ago
• kerighan / graph-walker
  Fastest random walks generator on networkx graphs
  ☆75Updated last year
• jajupmochi / graphkit-learn
  A python package for graph kernels, graph edit distances, and graph pre-image problem.
  ☆128Updated 5 months ago
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆89Updated 6 years ago
• fukien / BiANE
  Codes for our SIGIR'20 paper "BiANE: Bipartite Attributed Network Embedding".
  ☆15Updated last year
• Dru-Mara / EvalNE
  Source code for EvalNE, a Python library for evaluating Network Embedding methods.
  ☆106Updated last year
• hungnt55 / Stop-and-Stare
  ☆16Updated 8 years ago
• linhongseba / Temporal-Network-Embedding
  The implementation that infers the temporal latent spaces for a sequence of dynamic graph snapshots
  ☆64Updated 8 years ago
• yzhao062 / data-mining-conferences
  Ranking, acceptance rate, deadline, and publication tips
  ☆336Updated 4 years ago
• snap-stanford / graphwave
  ☆173Updated 6 years ago