puzzlef / leiden-communities-openmpLinks
Design of OpenMP-based Parallel Leiden algorithm for community detection.
☆17Updated 6 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:
- gBolt--very fast implementation for gSpan algorithm in data mining☆58Updated 4 years ago
- Implementation of the Leiden algorithm for various quality functions to be used with igraph in Python.☆698Updated 2 weeks ago
- A fast, parallelized, memory efficient, and cache-optimized Python implementation of node2vec☆170Updated this week
- Implementation of the Louvain algorithm for community detection with various methods for use with igraph in python.☆250Updated last year
- ☆144Updated 4 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆89Updated 6 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 fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net☆35Updated 3 months ago
- Standardized higher-order datasets with corresponding datasheets☆17Updated last month
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 5 years ago
- OpenMP implementation of Graph Community Detection, with a number of parallel heuristics/approximate computing techniques☆21Updated 2 years ago
- Large scale graph learning on a single machine.☆164Updated 7 months ago
- ☆51Updated 8 years ago
- Algorithms to list k-cliques in real-world graphs☆25Updated 4 years ago
- I am currently a Senior Researcher at L3S Research Center, Leibniz University Hannover, Germany.☆24Updated 4 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆154Updated last year
- GBBS: Graph Based Benchmark Suite☆213Updated 2 months ago
- FORA: Simple and Effective Approximate Single-Source Personalized Pagerank☆31Updated 4 years ago
- The SEMB library is an easy-to-use tool for getting and evaluating structural node embeddings in graphs.☆18Updated 2 years ago
- A collection of resources on dynamic/streaming/temporal/evolving graph processing systems, databases, data structures, datasets, and rela…☆141Updated 2 years ago
- ☆14Updated 4 years ago
- Fitting power-law distributions to empirical data, according to the method of Clauset, Shalizi and Newman☆50Updated 9 months ago
- A general-purpose, distributed graph random walk engine.☆109Updated 2 years ago
- (PLEASE USE https://github.com/HanKruiger/tsNET) This is here for historical purpose only.☆10Updated 6 years ago
- Community Discovery Library☆406Updated last week
- Programs to identify link communities in complex networks☆97Updated 4 years ago
- The source code for BUTTERFLY COUNTING IN BIPARTITE NETWORKS☆12Updated 6 years ago
- ORbit Counting Algorithm☆41Updated 8 years ago