niklas-uhl / katric
KaTric: scalable distributed-memory triangle counting made in Karlsruhe
☆13Updated last year
Alternatives and similar repositories for katric:
Users that are interested in katric are comparing it to the libraries listed below
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Updated last month
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 2 weeks ago
- Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.☆12Updated this week
- ☆17Updated last month
- Winning Solver of PACE Challenge 2019 Track A☆12Updated 3 years ago
- REplicated STORagE☆13Updated 2 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆37Updated last month
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆38Updated this week
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆14Updated 2 weeks ago
- More Hierarchy in Route Planning Using Edge Hierarchies☆15Updated 5 years ago
- KaMPIng: (Near) zero-overhead MPI wrapper for modern C++☆50Updated last month
- Parallel Weighted Random Sampling☆19Updated 4 years ago
- ☆17Updated 4 months ago
- Packed and Compressed Hash Tables☆15Updated last week
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆140Updated this week
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Updated last year
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆22Updated 5 months ago
- Parallel Graph Input Output☆18Updated last year
- Learned Monotone Minimal Perfect Hashing☆25Updated 2 weeks ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆24Updated last year
- Implementation of the sacabench framework☆16Updated 3 years ago
- Generate pgfplots or gnuplots from embedded SQL statements☆27Updated 8 months ago
- ☆9Updated 6 years ago
- Graph edge partitioning algorithms☆45Updated 5 years ago
- GBBS: Graph Based Benchmark Suite☆205Updated 4 months ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆427Updated 3 weeks ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆109Updated 3 months ago
- Dynamic data structure for sparse graphs.☆30Updated last year
- Maximum independent sets and vertex covers of large sparse graphs.☆73Updated last week
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆20Updated 2 years ago