puzzlef / leiden-communities-openmpLinks
Design of OpenMP-based Parallel Leiden algorithm for community detection.
☆14Updated last month
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:
- ☆51Updated 8 years ago
- gBolt--very fast implementation for gSpan algorithm in data mining☆57Updated 3 years ago
- ☆17Updated 5 months ago
- I am currently a Senior Researcher at L3S Research Center, Leibniz University Hannover, Germany.☆24Updated 4 years ago
- C implementation of the Louvain method for community detection in graphs☆12Updated 5 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆87Updated 6 years ago
- The SEMB library is an easy-to-use tool for getting and evaluating structural node embeddings in graphs.☆17Updated 2 years ago
- A package for computing Graph Kernels☆104Updated last year
- ☆29Updated 7 years ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆26Updated 3 years ago
- Implementation of the Louvain algorithm for community detection with various methods for use with igraph in python.☆248Updated 9 months ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 5 years ago
- Implementation of a scalable embedding method suggested in WSDM2020☆12Updated 5 years ago
- An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)☆70Updated 2 years ago
- LEMON: A local algorithm for fast, high-precision overlapping community detection☆54Updated 7 years ago
- Omega Index for evaluation of overlapping community structure - (Python package available through pip)☆12Updated 3 years ago
- A curated list of community detection research papers with implementations.☆12Updated 5 years ago
- Graph partitioning for distributed GNN training☆14Updated 2 years ago
- A toolkit for de novo genome assembly based on Pregel.☆12Updated 5 years ago
- Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.☆161Updated 4 years ago
- Fast consensus clustering in networks☆22Updated 8 months ago
- Graph kernels☆56Updated 3 years ago
- markov clustering in python☆173Updated 3 years ago
- Embedding billion-scale networks accurately in one hour (TKDE paper 2023)☆11Updated last year
- Tools for the generation, analysis and visualisation of complex networks in hyperbolic space.☆27Updated 6 years ago
- Community Discovery Library☆398Updated last month
- Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures☆130Updated 4 years ago
- Python wrapper for the Kavosh network motif finder☆52Updated 10 years ago
- The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"☆25Updated 7 years ago
- KDD Course Project - Implementation of Community Detection Algorithms and Evaluations and Some Datasets (港科博一时候KDD课程作业) - by Shixuan Sun …☆43Updated 6 years ago