hu-macsy / dhb
Dynamic Hashed Blocks (DHB) data structure for dynamic graphs
☆12Updated 2 months ago
Alternatives and similar repositories for dhb:
Users that are interested in dhb are comparing it to the libraries listed below
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆13Updated last year
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Updated 2 months ago
- ☆17Updated last week
- Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.☆12Updated last week
- Parallel Weighted Random Sampling☆19Updated 4 years ago
- More Hierarchy in Route Planning Using Edge Hierarchies☆15Updated 4 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆36Updated 3 weeks ago
- ☆9Updated 6 years ago
- Winning Solver of PACE Challenge 2019 Track A☆13Updated 3 years ago
- ☆15Updated last month
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆39Updated this week
- Packed and Compressed Hash Tables☆15Updated last year
- REplicated STORagE☆13Updated last year
- Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"☆23Updated 4 years ago
- Dynamic data structure for sparse graphs.☆29Updated 9 months ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆22Updated last year
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆136Updated this week
- ☆36Updated 5 years ago
- KaMPIng: (Near) zero-overhead MPI wrapper for modern C++☆44Updated last week
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Updated last year
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆20Updated 2 years ago
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆14Updated 2 months ago
- Implementation of the HYPE hypergraph partitioner.☆18Updated 5 years ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆23Updated 2 months ago
- ☆20Updated 3 years ago
- Learned Monotone Minimal Perfect Hashing☆25Updated last month
- A platform to evaluate techniques used in multicore graph processing.☆37Updated 6 years ago
- Super Scalar Sample Sort in modern C++☆20Updated 4 years ago
- A simple implementation of the packed memory array☆18Updated 11 years ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆86Updated 5 years ago