hu-macsy / dhbLinks
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
Sorting:
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆13Updated last year
- ☆17Updated 2 months ago
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Updated 3 months ago
- Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.☆12Updated this week
- Parallel Weighted Random Sampling☆20Updated 4 years ago
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Updated 5 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆38Updated 3 weeks ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆39Updated this week
- ☆17Updated 5 months ago
- Winning Solver of PACE Challenge 2019 Track A☆13Updated 3 years ago
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆140Updated this week
- ☆9Updated 6 years ago
- Packed and Compressed Hash Tables☆15Updated last month
- REplicated STORagE☆13Updated 2 years ago
- Implementation of the HYPE hypergraph partitioner.☆19Updated 5 years ago
- Parallel Graph Input Output☆19Updated last year
- Dynamic data structure for sparse graphs.☆30Updated last year
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆25Updated last year
- KaMPIng: (Near) zero-overhead MPI wrapper for modern C++☆50Updated 2 weeks ago
- Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"☆23Updated 5 years ago
- ☆37Updated 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…☆10Updated 2 years ago
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆14Updated 2 months ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆19Updated 2 months ago
- Graph edge partitioning algorithms☆45Updated 5 years ago
- ☆11Updated 3 years ago
- ☆21Updated 4 years ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆87Updated 5 years ago
- A platform to evaluate techniques used in multicore graph processing.☆37Updated 6 years ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆109Updated 5 months ago