molaupi / karri
Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.
☆12Updated this week
Alternatives and similar repositories for karri:
Users that are interested in karri are comparing it to the libraries listed below
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Updated this week
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆13Updated last year
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 3 months ago
- Winning Solver of PACE Challenge 2019 Track A☆12Updated 3 years ago
- ☆17Updated 3 weeks ago
- Paper, code, experiments and evaluation for ESA2020 paper "Space-efficient, Fast and Exact Routing in Time-dependent Road Networks"☆10Updated 3 years ago
- More Hierarchy in Route Planning Using Edge Hierarchies☆15Updated 4 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆37Updated 2 weeks ago
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆14Updated 3 months ago
- Maximum independent sets and vertex covers of large sparse graphs.☆73Updated 3 months ago
- REplicated STORagE☆13Updated last year
- Packed and Compressed Hash Tables☆15Updated last year
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Updated last year
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆138Updated last week
- Vienna Graph Clustering☆15Updated last month
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆39Updated this week
- KaMPIng: (Near) zero-overhead MPI wrapper for modern C++☆44Updated this week
- Generate pgfplots or gnuplots from embedded SQL statements☆26Updated 6 months ago
- Near-linear time algorithm for computing near-maximum independent set☆18Updated 2 years ago
- Exactcolors is a collection of algorithms for exactly solving graph coloring and weighted stable set problems.☆13Updated 2 years ago
- Speeded-up LKH-3 version + Set Partitioning Heuristic phase. Participated to 12th DIMACS implementation challenge.☆11Updated 3 years ago
- Implementation of the HYPE hypergraph partitioner.☆18Updated 5 years ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆22Updated 3 months ago
- Parallel Weighted Random Sampling☆19Updated 4 years ago
- Malleable Load Balancer. Massively Parallel Logic Backend. Award-winning SAT solving for the cloud.☆64Updated this week
- GBBS: Graph Based Benchmark Suite☆201Updated 2 months ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆418Updated last week
- A standalone local search solver for general integer linear programming☆16Updated 7 months ago
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆20Updated 2 years ago
- Learned Monotone Minimal Perfect Hashing☆25Updated 2 months ago