puzzlef / leiden-communities-openmpLinks
Design of OpenMP-based Parallel Leiden algorithm for community detection.
☆14Updated 2 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:
- ☆51Updated 8 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆87Updated 6 years ago
- ☆29Updated 7 years ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 5 years ago
- gBolt--very fast implementation for gSpan algorithm in data mining☆58Updated 3 years ago
- Implementation of a scalable embedding method suggested in WSDM2020☆12Updated 5 years ago
- Programs to identify link communities in complex networks☆96Updated 4 years ago
- Discovering Polarized Communities in Signed Networks☆13Updated 5 years ago
- LEMON: A local algorithm for fast, high-precision overlapping community detection☆54Updated 7 years ago
- Java package that provides data structures and algorithms for network analysis.☆146Updated last year
- ☆17Updated 6 months ago
- Tools for the generation, analysis and visualisation of complex networks in hyperbolic space.☆27Updated 6 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 the Louvain method for community detection in graphs☆12Updated 5 years ago
- Local Community Detection in Multiple Netwrks☆14Updated 4 months ago
- A package for computing Graph Kernels☆104Updated last year
- Benchmark for Graph Embedding Methods☆48Updated 4 years ago
- Omega Index for evaluation of overlapping community structure - (Python package available through pip)☆12Updated 3 years ago
- ☆20Updated 4 years ago
- Python wrapper for the Kavosh network motif finder☆52Updated 10 years ago
- A curated list of community detection research papers with implementations.☆12Updated 5 years ago
- Implementation of the Leiden algorithm for various quality functions to be used with igraph in Python.☆664Updated last week
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆26Updated 3 years ago
- ORbit Counting Algorithm☆38Updated 8 years ago
- Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.☆162Updated 4 years ago
- An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)☆70Updated 2 years ago
- ☆142Updated 4 years ago
- Fastest random walks generator on networkx graphs☆75Updated 7 months ago
- A Python framework for generating multilayer networks with planted mesoscale structure.☆18Updated 2 years ago
- Automatic feature extraction and node role assignment for transfer learning on graphs (ReFeX & RolX)☆87Updated 11 months ago