Alternatives and similar repositories for leiden-communities-openmp

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

• Jokeren / gBolt
  gBolt--very fast implementation for gSpan algorithm in data mining
  ☆60Updated 4 years ago
• williamweiwu / williamweiwu.github.io
  I am currently a Senior Researcher at L3S Research Center, Leibniz University Hannover, Germany.
  ☆24Updated 4 years ago
• krishnanlab / PecanPy
  A fast, parallelized, memory efficient, and cache-optimized Python implementation of node2vec
  ☆173Updated last week
• thocevar / orca
  ORbit Counting Algorithm
  ☆43Updated 9 years ago
• BlaiseMuhirwa / flatnav
  A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net
  ☆40Updated 3 weeks ago
• aaronmcdaid / Overlapping-NMI
  ☆51Updated 9 years ago
• wangboyunze / Network_Enhancement
  ☆29Updated 8 years ago
• Kingsford-Group / omhismb2019
  ☆23Updated 2 years ago
• tobc / dartminhash
  DartMinHash: Fast Sketching for Weighted Sets
  ☆12Updated last month
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆48Updated 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
• LijunChang / Cohesive_subgraph_book
  Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
  ☆26Updated 3 years ago
• anthbapt / multixrank
  ☆20Updated last year
• oertl / probminhash
  ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity
  ☆44Updated 5 years ago
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆88Updated 6 years ago
• maxdan94 / LouvainNE
  Implementation of a scalable embedding method suggested in WSDM2020
  ☆12Updated 5 years ago
• BorgwardtLab / HOGImine
  Higher-order genetic interaction discovery with network-based biological priors.
  ☆13Updated last year
• BorgwardtLab / GraphKernels
  A package for computing Graph Kernels
  ☆102Updated 2 years ago
• yunwilliamyu / hyperminhash
  LogLog space version of MinHash by combining ideas from HyperLogLog and b-bit MinHash
  ☆57Updated 5 years ago
• maxdan94 / Density-Friendly
  C implementation of algorithms to find the Density-Friendly graph decomposition
  ☆11Updated 5 years ago
• PASSIONLab / ELBA
  Parallel String Graph Construction, Transitive Reduction, and Contig Generation for De Novo Genome Assembly
  ☆16Updated last year
• THU-numbda / SketchNE
  Embedding billion-scale networks accurately in one hour (TKDE paper 2023)
  ☆11Updated 2 years ago
• dnbaker / sketch
  C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
  ☆158Updated last year
• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆88Updated 2 years ago
• AnacletoLAB / ensmallen
  🍇 Ensmallen is the Rust/Python high-performance graph processing submodule of the GRAPE library.
  ☆40Updated 4 months ago
• yaobaiwei / PPA-Assembler
  A toolkit for de novo genome assembly based on Pregel.
  ☆12Updated 6 years ago
• gtremper / Network-Motif
  Python wrapper for the Kavosh network motif finder
  ☆52Updated 11 years ago
• GuyAllard / markov_clustering
  markov clustering in python
  ☆176Updated 4 years ago
• Moado / Community_Detection
  A curated list of community detection research papers with implementations.
  ☆13Updated 6 years ago
• GiulioRossetti / cdlib
  Community Discovery Library
  ☆413Updated last month