KarlsruheMIS / pace-2019Links
Winning Solver of PACE Challenge 2019 Track A
☆13Updated 4 years ago
Alternatives and similar repositories for pace-2019
Users that are interested in pace-2019 are comparing it to the libraries listed below
Sorting:
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆14Updated 2 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…☆11Updated 2 years ago
- Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.☆12Updated this week
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆463Updated 2 weeks ago
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Updated 3 months ago
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Updated 5 years ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 2 months ago
- KaGen: Communication-free Massively Distributed Graph Generators☆41Updated last week
- GBBS: Graph Based Benchmark Suite☆214Updated 3 months ago
- KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…☆493Updated 3 weeks ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆44Updated this week
- vertex cover solver☆30Updated 6 years ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆28Updated 2 years ago
- Near-linear time algorithm for computing near-maximum independent set☆19Updated 3 years ago
- ☆25Updated 11 months ago
- Generate pgfplots or gnuplots from embedded SQL statements☆30Updated 6 months ago
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆167Updated this week
- Paper, code, experiments and evaluation for ESA2020 paper "Space-efficient, Fast and Exact Routing in Time-dependent Road Networks"☆11Updated 4 years ago
- Ligra: A Lightweight Graph Processing Framework for Shared Memory☆481Updated last year
- ☆17Updated 8 months ago
- A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines☆396Updated this week
- Graph edge partitioning algorithms☆48Updated 6 years ago
- Dynamic data structure for sparse graphs.☆31Updated last year
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆25Updated last year
- Galois: C++ library for multi-core and multi-node parallelization☆342Updated last year
- Parallel Weighted Random Sampling☆19Updated 4 years ago
- Boost.org graph module☆365Updated last week
- Trillion-edge Scale Graph Edge Partitioning☆30Updated 6 years ago
- Implementation of the sacabench framework☆18Updated 4 years ago
- ☆25Updated 4 years ago