hu-macsy / dhb
Dynamic Hashed Blocks (DHB) data structure for dynamic graphs
☆12Updated last month
Related projects: ⓘ
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆12Updated last year
- ☆13Updated 4 months ago
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Updated 5 months ago
- Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.☆12Updated 3 weeks ago
- KaGen: Communication-free Massively Distributed Graph Generators☆35Updated this week
- Parallel Weighted Random Sampling☆19Updated 3 years ago
- ☆12Updated 4 months ago
- ☆9Updated 5 years ago
- More Hierarchy in Route Planning Using Edge Hierarchies☆15Updated 4 years ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆32Updated this week
- Dynamic data structure for sparse graphs.☆26Updated 5 months ago
- Winning Solver of PACE Challenge 2019 Track A☆12Updated 3 years ago
- KaMPIng: (Near) zero-overhead MPI wrapper for modern C++☆27Updated this week
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆115Updated this week
- Implementation of the HYPE hypergraph partitioner.☆17Updated 4 years ago
- Packed and Compressed Hash Tables☆14Updated 9 months ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆21Updated last year
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆18Updated this week
- ☆33Updated 5 years ago
- REplicated STORagE☆11Updated last year
- Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"☆23Updated 4 years ago
- CPAM: Compressed Parallel Augmented Maps☆19Updated last week
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆14Updated 6 months ago
- Near-linear time algorithm for computing near-maximum independent set☆16Updated 2 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆14Updated last week
- Learned Monotone Minimal Perfect Hashing☆20Updated 2 weeks ago
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆20Updated 2 years ago
- Source code of "PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration", published in SIGMOD'2021 - By Shixuan Sun, Yuhang Chen…☆14Updated 3 years ago
- Multi-platform topology-aware memory management library☆13Updated 4 years ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆83Updated 5 years ago