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 2 months ago
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆13Updated last year
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 2 months ago
- More Hierarchy in Route Planning Using Edge Hierarchies☆15Updated 4 years ago
- ☆16Updated 2 months ago
- KaGen: Communication-free Massively Distributed Graph Generators☆35Updated last week
- Winning Solver of PACE Challenge 2019 Track A☆13Updated 3 years ago
- REplicated STORagE☆13Updated 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
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆14Updated last month
- Packed and Compressed Hash Tables☆15Updated last year
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Updated last year
- Maximum independent sets and vertex covers of large sparse graphs.☆73Updated 2 months ago
- Vienna Graph Clustering☆15Updated this week
- Generate pgfplots or gnuplots from embedded SQL statements☆26Updated 5 months ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆38Updated this week
- This repository contains C++ source code used in several publications in the area of route planning.☆38Updated 3 years ago
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆134Updated this week
- Exactcolors is a collection of algorithms for exactly solving graph coloring and weighted stable set problems.☆13Updated 2 years ago
- OpenPLS: An open phased local search (PLS) implementation☆9Updated 4 years ago
- Implementation of the sacabench framework☆15Updated 3 years ago
- Learned Monotone Minimal Perfect Hashing☆25Updated last month
- C++ implementation and evaluation for the InertialFlowCutter algorithm to compute Customizable Contraction Hierarchy orders.☆12Updated last year
- Experimental FlowCutter Code☆12Updated 5 years ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆23Updated 2 months ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆413Updated this week
- 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☆18Updated 2 years ago
- Implementation of the HYPE hypergraph partitioner.☆18Updated 5 years ago
- Parallel Weighted Random Sampling☆19Updated 4 years ago