Alternatives and similar repositories for leiden-communities-openmp

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

• krishnanlab / PecanPy
  A fast, parallelized, memory efficient, and cache-optimized Python implementation of node2vec
  ☆164Updated last week
• williamweiwu / williamweiwu.github.io
  I am currently a Senior Researcher at L3S Research Center, Leibniz University Hannover, Germany.
  ☆24Updated 4 years ago
• Jokeren / gBolt
  gBolt--very fast implementation for gSpan algorithm in data mining
  ☆58Updated 4 years ago
• kfoynt / LocalGraphClustering
  ☆143Updated 4 years ago
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆87Updated 6 years ago
• LijunChang / Cohesive_subgraph_book
  Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
  ☆26Updated 3 years ago
• KnightKingWalk / KnightKing
  A general-purpose, distributed graph random walk engine.
  ☆109Updated last year
• marius-team / marius
  Large scale graph learning on a single machine.
  ☆163Updated 4 months ago
• wangsibovictor / fora
  FORA: Simple and Effective Approximate Single-Source Personalized Pagerank
  ☆31Updated 4 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
• betterenvi / gSpan
  Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.
  ☆204Updated 4 years ago
• AnacletoLAB / ensmallen
  🍇 Ensmallen is the Rust/Python high-performance graph processing submodule of the GRAPE library.
  ☆40Updated 11 months ago
• thocevar / orca
  ORbit Counting Algorithm
  ☆38Updated 8 years ago
• gtremper / Network-Motif
  Python wrapper for the Kavosh network motif finder
  ☆52Updated 10 years ago
• aaronmcdaid / Overlapping-NMI
  ☆51Updated 8 years ago
• vtraag / louvain-igraph
  Implementation of the Louvain algorithm for community detection with various methods for use with igraph in python.
  ☆249Updated 10 months ago
• amazon-science / panrep
  ☆15Updated 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.
  ☆162Updated 4 years ago
• BlaiseMuhirwa / flatnav
  A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net
  ☆30Updated 3 weeks ago
• CWTSLeiden / networkanalysis
  Java package that provides data structures and algorithms for network analysis.
  ☆147Updated last year
• alibaba / graphlearn-for-pytorch
  A GPU-accelerated graph learning library for PyTorch, facilitating the scaling of GNN training and inference.
  ☆138Updated 3 months ago
• guowentian / dynamicppr
  The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"
  ☆25Updated 7 years ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆211Updated 7 months ago
• anthbapt / multixrank
  ☆18Updated 7 months ago
• benedekrozemberczki / RolX
  An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)
  ☆70Updated 2 years ago
• jdmoorman / uclasm
  Subgraph matching and isomorphisms in Python.
  ☆27Updated 2 years ago
• ECP-ExaGraph / grappolo
  OpenMP implementation of Graph Community Detection, with a number of parallel heuristics/approximate computing techniques
  ☆21Updated 2 years ago
• vtraag / leidenalg
  Implementation of the Leiden algorithm for various quality functions to be used with igraph in Python.
  ☆675Updated last week
• GiulioRossetti / cdlib
  Community Discovery Library
  ☆400Updated last week
• IntelLabs / Trans-Omics-Acceleration-Library
  ☆16Updated last month