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 4 months ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 4 months ago
- Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.☆13Updated 3 weeks ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆47Updated 3 weeks ago
- ☆17Updated 9 months ago
- KaGen: Communication-free Massively Distributed Graph Generators☆41Updated last month
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Updated 5 years ago
- Winning Solver of PACE Challenge 2019 Track A☆13Updated 4 years ago
- REplicated STORagE☆13Updated 2 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 3 years ago
- GBBS: Graph Based Benchmark Suite☆214Updated 2 weeks ago
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆15Updated 9 months ago
- Parallel Weighted Random Sampling☆20Updated 5 years ago
- ☆25Updated last month
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆470Updated 2 months ago
- A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines☆399Updated last month
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆117Updated last year
- 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 9 months ago
- Parallel Balanced Binary Tree Structures☆121Updated 9 months 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.☆34Updated 9 months ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆90Updated 6 years ago
- Implementation of the sacabench framework☆18Updated 4 years ago
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆167Updated 2 weeks ago
- KaMPIng: (Near) zero-overhead MPI wrapper for modern C++☆68Updated last month
- Dynamic data structure for sparse graphs.☆31Updated last year
- A simple implementation of the packed memory array☆20Updated 12 years ago
- Multi-platform topology-aware memory management library☆13Updated 5 years ago