Alternatives and similar repositories for leiden-communities-openmp:

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

• vtraag / louvain-igraph
  Implementation of the Louvain algorithm for community detection with various methods for use with igraph in python.
  ☆247Updated 5 months ago
• bagrow / linkcomm
  Programs to identify link communities in complex networks
  ☆93Updated 4 years ago
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆87Updated 5 years ago
• aaronmcdaid / Overlapping-NMI
  ☆51Updated 8 years ago
• KarypisLab / PM4GNN
  Graph partitioning for distributed GNN training
  ☆12Updated last year
• Moado / Community_Detection
  A curated list of community detection research papers with implementations.
  ☆12Updated 5 years ago
• GiulioRossetti / cdlib
  Community Discovery Library
  ☆385Updated 5 months ago
• thocevar / orca
  ORbit Counting Algorithm
  ☆36Updated 8 years ago
• LijunChang / Cohesive_subgraph_book
  Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
  ☆24Updated 2 years ago
• darrenstrash / quick-cliques
  Quickly compute all maximal cliques of a graph
  ☆76Updated 6 years ago
• CWTSLeiden / networkanalysis
  Java package that provides data structures and algorithms for network analysis.
  ☆146Updated last year
• yaobaiwei / PPA-Assembler
  A toolkit for de novo genome assembly based on Pregel.
  ☆12Updated 5 years ago
• Jokeren / gBolt
  gBolt--very fast implementation for gSpan algorithm in data mining
  ☆55Updated 3 years ago
• athomo / kcore
  ☆11Updated 7 years ago
• williamweiwu / williamweiwu.github.io
  I am currently a Senior Researcher at L3S Research Center, Leibniz University Hannover, Germany.
  ☆24Updated 3 years ago
• galanisl / NetHypGeom
  Tools for the generation, analysis and visualisation of complex networks in hyperbolic space.
  ☆26Updated 6 years ago
• YupingLu / biclique
  Maximal Biclique Enumeration in Bipartite Graphs
  ☆21Updated 4 years ago
• anilpacaci / streaming-graph-partitioning
  Experimental Setup for Performance Analysis of Streaming Algorithms
  ☆31Updated 3 years ago
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆25Updated 3 years ago
• maxdan94 / Density-Friendly
  C implementation of algorithms to find the Density-Friendly graph decomposition
  ☆11Updated 4 years ago
• egalimberti / polarized_communities
  Discovering Polarized Communities in Signed Networks
  ☆13Updated 5 years ago
• ECP-ExaGraph / grappolo
  OpenMP implementation of Graph Community Detection, with a number of parallel heuristics/approximate computing techniques
  ☆20Updated last year
• RapidsAtHKUST / SubgraphMatching
  In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo
  ☆150Updated last year
• KnightKingWalk / KnightKing
  A general-purpose, distributed graph random walk engine.
  ☆111Updated last year
• marius-team / marius
  Large scale graph learning on a single machine.
  ☆161Updated 5 months ago
• benedekrozemberczki / RolX
  An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)
  ☆70Updated 2 years ago
• vtraag / leidenalg
  Implementation of the Leiden algorithm for various quality functions to be used with igraph in Python.
  ☆639Updated 4 months ago
• domargan / awesome-dynamic-graphs
  A collection of resources on dynamic/streaming/temporal/evolving graph processing systems, databases, data structures, datasets, and rela…
  ☆135Updated last year
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 3 years ago