Alternatives and similar repositories for leiden-communities-openmp

Users that are interested in leiden-communities-openmp are comparing it to the libraries listed below

• aaronmcdaid / Overlapping-NMI
  ☆51Updated 9 years ago
• BlaiseMuhirwa / flatnav
  A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net
  ☆36Updated 4 months ago
• vtraag / louvain-igraph
  Implementation of the Louvain algorithm for community detection with various methods for use with igraph in python.
  ☆253Updated last year
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆48Updated 4 years ago
• GiulioRossetti / cdlib
  Community Discovery Library
  ☆407Updated last month
• vtraag / leidenalg
  Implementation of the Leiden algorithm for various quality functions to be used with igraph in Python.
  ☆703Updated last week
• krishnanlab / PecanPy
  A fast, parallelized, memory efficient, and cache-optimized Python implementation of node2vec
  ☆172Updated 2 weeks ago
• gtremper / Network-Motif
  Python wrapper for the Kavosh network motif finder
  ☆52Updated 10 years ago
• brj0 / nndescent
  C++/Python implementation of Nearest Neighbor Descent for efficient approximate nearest neighbor search
  ☆22Updated last year
• YixuanLi / LEMON
  LEMON: A local algorithm for fast, high-precision overlapping community detection
  ☆55Updated 8 years ago
• GuyAllard / markov_clustering
  markov clustering in python
  ☆175Updated 3 years ago
• williamweiwu / williamweiwu.github.io
  I am currently a Senior Researcher at L3S Research Center, Leibniz University Hannover, Germany.
  ☆24Updated 4 years ago
• thocevar / orca
  ORbit Counting Algorithm
  ☆41Updated 8 years ago
• THU-numbda / SketchNE
  Embedding billion-scale networks accurately in one hour (TKDE paper 2023)
  ☆11Updated 2 years ago
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆89Updated 6 years ago
• kfoynt / LocalGraphClustering
  ☆144Updated 4 years ago
• uwescience / GossipMap
  GossipMap: distributed parallel community detection algorithm
  ☆22Updated 10 years ago
• dnbaker / sketch
  C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
  ☆154Updated last year
• mapequation / infomap
  Multi-level network clustering based on the Map Equation
  ☆471Updated 3 months ago
• marius-team / marius
  Large scale graph learning on a single machine.
  ☆165Updated 8 months ago
• GiulioRossetti / DEMON
  DEMON: a local-first discovery method for overlapping communities.
  ☆35Updated last year
• anthbapt / multixrank
  ☆18Updated 10 months ago
• LijunChang / Cohesive_subgraph_book
  Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
  ☆26Updated 3 years ago
• micans / mcl
  MCL, the Markov Cluster algorithm, also known as Markov Clustering, is a method and program for clustering weighted or simple networks, a…
  ☆101Updated last month
• KnightKingWalk / KnightKing
  A general-purpose, distributed graph random walk engine.
  ☆109Updated 2 years ago
• xgi-org / xgi-data
  Standardized higher-order datasets with corresponding datasheets
  ☆17Updated 2 months ago
• YupingLu / biclique
  Maximal Biclique Enumeration in Bipartite Graphs
  ☆21Updated 5 years ago
• maxdan94 / LouvainNE
  Implementation of a scalable embedding method suggested in WSDM2020
  ☆12Updated 5 years ago
• letitiaLiu / PisCES
  Global spectral clustering in dynamic networks
  ☆20Updated 7 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