niklas-uhl / katricLinks
KaTric: scalable distributed-memory triangle counting made in Karlsruhe
☆14Updated 2 years ago
Alternatives and similar repositories for katric
Users that are interested in katric are comparing it to the libraries listed below
Sorting:
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Updated 3 months ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 2 months ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆44Updated this week
- KaGen: Communication-free Massively Distributed Graph Generators☆41Updated last week
- ☆17Updated 8 months ago
- Winning Solver of PACE Challenge 2019 Track A☆13Updated 4 years ago
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Updated 5 years ago
- KaPoCE is a framework for solving the cluster editing problem that asks to transform an input graph into a cluster graph (a disjoint unio…☆11Updated 2 years ago
- REplicated STORagE☆13Updated 2 years ago
- GBBS: Graph Based Benchmark Suite☆214Updated 3 months ago
- Parallel Weighted Random Sampling☆19Updated 4 years ago
- ☆25Updated 11 months ago
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆15Updated 7 months ago
- A simple implementation of the packed memory array☆20Updated 12 years ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆116Updated 10 months ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆463Updated 2 weeks ago
- A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines☆396Updated this week
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆28Updated 2 years ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆25Updated 2 years ago
- Packed and Compressed Hash Tables☆15Updated 7 months ago
- Implementation of the sacabench framework☆18Updated 4 years ago
- ☆25Updated 4 years ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆25Updated last year
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆32Updated 7 months ago
- Parallel Balanced Binary Tree Structures☆121Updated 8 months ago
- Dynamic data structure for sparse graphs.☆31Updated last year
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆90Updated 6 years ago
- Generate pgfplots or gnuplots from embedded SQL statements☆30Updated 6 months ago
- Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"☆23Updated 5 years ago
- Vienna Graph Clustering☆16Updated last week