puzzlef / leiden-communities-openmpLinks
Design of OpenMP-based Parallel Leiden algorithm for community detection.
☆17Updated 4 months ago
Alternatives and similar repositories for leiden-communities-openmp
Users that are interested in leiden-communities-openmp are comparing it to the libraries listed below
Sorting:
- A fast, parallelized, memory efficient, and cache-optimized Python implementation of node2vec☆169Updated 3 weeks ago
- gBolt--very fast implementation for gSpan algorithm in data mining☆58Updated 4 years ago
- I am currently a Senior Researcher at L3S Research Center, Leibniz University Hannover, Germany.☆24Updated 4 years ago
- Implementation of the Louvain algorithm for community detection with various methods for use with igraph in python.☆249Updated last year
- Embedding billion-scale networks accurately in one hour (TKDE paper 2023)☆11Updated last year
- A Parallel Graphlet Decomposition Library for Large Graphs☆88Updated 6 years ago
- Maximal Biclique Enumeration in Bipartite Graphs☆21Updated 5 years ago
- ☆51Updated 8 years ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆26Updated 3 years ago
- C++/Python implementation of Nearest Neighbor Descent for efficient approximate nearest neighbor search☆21Updated last year
- A curated list of community detection research papers with implementations.☆12Updated 5 years ago
- ☆29Updated 7 years ago
- Light-weight GPU kernel interface for graph operations☆15Updated 5 years ago
- Implementation of the Leiden algorithm for various quality functions to be used with igraph in Python.☆686Updated last week
- Python wrapper for the Kavosh network motif finder☆52Updated 10 years ago
- Implementation of a scalable embedding method suggested in WSDM2020☆12Updated 5 years ago
- OpenMP implementation of Graph Community Detection, with a number of parallel heuristics/approximate computing techniques☆21Updated 2 years ago
- Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.☆163Updated 4 years ago
- ORbit Counting Algorithm☆40Updated 8 years ago
- Parallel String Graph Construction, Transitive Reduction, and Contig Generation for De Novo Genome Assembly☆16Updated last year
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 5 years ago
- Community Discovery Library☆403Updated last month
- 🍇 Ensmallen is the Rust/Python high-performance graph processing submodule of the GRAPE library.☆40Updated last year
- A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net☆35Updated 2 months ago
- Affinity Propagation for Sparse Similarities☆21Updated 14 years ago
- A tiny library for larger graphs☆119Updated 11 months ago
- A general-purpose, distributed graph random walk engine.☆109Updated 2 years ago
- Large scale graph learning on a single machine.☆164Updated 6 months ago
- Daichi Amagata and Takahiro Hara, SIGMOD2021☆15Updated last year
- MCL, the Markov Cluster algorithm, also known as Markov Clustering, is a method and program for clustering weighted or simple networks, a…☆100Updated this week