molaupi / karri
Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.
☆12Updated this week
Related projects ⓘ
Alternatives and complementary repositories for karri
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Updated last week
- ☆13Updated 3 weeks ago
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆13Updated last year
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 2 weeks ago
- KaGen: Communication-free Massively Distributed Graph Generators☆35Updated this week
- More Hierarchy in Route Planning Using Edge Hierarchies☆15Updated 4 years ago
- Winning Solver of PACE Challenge 2019 Track A☆13Updated 3 years ago
- KaMPIng: (Near) zero-overhead MPI wrapper for modern C++☆30Updated last week
- REplicated STORagE☆11Updated last year
- Paper, code, experiments and evaluation for ESA2020 paper "Space-efficient, Fast and Exact Routing in Time-dependent Road Networks"☆10Updated 3 years ago
- Packed and Compressed Hash Tables☆15Updated last year
- Vienna Graph Clustering☆15Updated 3 years ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Updated last year
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆35Updated this week
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆14Updated this week
- Generate pgfplots or gnuplots from embedded SQL statements☆25Updated 3 months ago
- A songbook about IT and computer science☆16Updated 5 years ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆18Updated 2 weeks ago
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆126Updated this week
- Implementation of the HYPE hypergraph partitioner.☆17Updated 4 years ago
- Implementation of the sacabench framework☆15Updated 3 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆15Updated last week
- Learned Monotone Minimal Perfect Hashing☆24Updated 2 months ago
- Maximum independent sets and vertex covers of large sparse graphs.☆72Updated 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
- Near-linear time algorithm for computing near-maximum independent set☆17Updated 2 years ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆396Updated 4 months ago
- Exactcolors is a collection of algorithms for exactly solving graph coloring and weighted stable set problems.☆13Updated 2 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆26Updated this week
- Parallel Weighted Random Sampling☆19Updated 3 years ago