Alternatives and similar repositories for leiden-communities-openmp:

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

• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆87Updated 6 years ago
• aaronmcdaid / Overlapping-NMI
  ☆52Updated 8 years ago
• williamweiwu / williamweiwu.github.io
  I am currently a Senior Researcher at L3S Research Center, Leibniz University Hannover, Germany.
  ☆24Updated 3 years ago
• Jokeren / gBolt
  gBolt--very fast implementation for gSpan algorithm in data mining
  ☆57Updated 3 years ago
• maxdan94 / Density-Friendly
  C implementation of algorithms to find the Density-Friendly graph decomposition
  ☆12Updated 5 years ago
• thocevar / orca
  ORbit Counting Algorithm
  ☆37Updated 8 years ago
• flyingdoog / RWM
  Local Community Detection in Multiple Netwrks
  ☆14Updated last month
• LijunChang / Cohesive_subgraph_book
  Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
  ☆25Updated 2 years ago
• PASSIONLab / CAGNET
  ☆45Updated 3 weeks ago
• amazon-science / panrep
  ☆15Updated 3 years ago
• KnightKingWalk / KnightKing
  A general-purpose, distributed graph random walk engine.
  ☆110Updated last year
• 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
• anilpacaci / streaming-graph-partitioning
  Experimental Setup for Performance Analysis of Streaming Algorithms
  ☆31Updated 3 years ago
• kfoynt / LocalGraphClustering
  ☆137Updated 4 years ago
• jshun / ppopp20-ae
  ☆18Updated 5 years ago
• Ashish7129 / Graph_Sampling
  Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.
  ☆161Updated 4 years ago
• YixuanLi / LEMON
  LEMON: A local algorithm for fast, high-precision overlapping community detection
  ☆54Updated 7 years ago
• wangsibovictor / fora
  FORA: Simple and Effective Approximate Single-Source Personalized Pagerank
  ☆31Updated 4 years ago
• spcl / gms
  GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning
  ☆26Updated 3 years ago
• anthbapt / multixrank
  ☆17Updated 3 months ago
• KarypisLab / PM4GNN
  Graph partitioning for distributed GNN training
  ☆13Updated 2 years ago
• bagrow / linkcomm
  Programs to identify link communities in complex networks
  ☆96Updated 4 years ago
• zakimjz / DistGraph
  Distributed Graph Mining on a Massive "Single" Graph
  ☆15Updated 5 years ago
• YupingLu / biclique
  Maximal Biclique Enumeration in Bipartite Graphs
  ☆21Updated 5 years ago
• nogrady / dynamo
  DynaMo: Dynamic Community Detection by Incrementally Maximizing Modularity
  ☆28Updated 3 years ago
• HanKruiger / tsnetwork
  (PLEASE USE https://github.com/HanKruiger/tsNET) This is here for historical purpose only.
  ☆10Updated 6 years ago
• gtremper / Network-Motif
  Python wrapper for the Kavosh network motif finder
  ☆51Updated 10 years ago
• GiulioRossetti / f1-communities
  A novel approach to evaluate community detection algorithms on ground truth
  ☆22Updated 3 years ago
• vtraag / louvain-igraph
  Implementation of the Louvain algorithm for community detection with various methods for use with igraph in python.
  ☆247Updated 7 months ago
• fabiopetroni / VGP
  A software package for one-pass Vertex-cut balanced Graph Partitioning.
  ☆30Updated 9 years ago