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
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Updated 5 years ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆469Updated last month
- Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.☆12Updated this week
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 3 months ago
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Updated 3 months ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆45Updated this week
- 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
- KaGen: Communication-free Massively Distributed Graph Generators☆41Updated last week
- GBBS: Graph Based Benchmark Suite☆214Updated 4 months ago
- Near-linear time algorithm for computing near-maximum independent set☆19Updated 3 years ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆28Updated 2 years ago
- ☆25Updated last week
- ☆17Updated 8 months ago
- A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines☆398Updated 3 weeks ago
- Maximum independent sets and vertex covers of large sparse graphs.☆79Updated last month
- vertex cover solver☆31Updated 6 years ago
- Galois: C++ library for multi-core and multi-node parallelization☆342Updated last year
- ☆25Updated 4 years ago
- KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…☆501Updated this week
- Vienna Graph Clustering☆17Updated last month
- Parallel Balanced Binary Tree Structures☆121Updated 8 months ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆25Updated last year
- Dynamic data structure for sparse graphs.☆31Updated last year
- Parallel Weighted Random Sampling☆19Updated 5 years ago
- Packed Memory Array☆17Updated 11 years ago
- ☆39Updated 6 years ago
- ☆22Updated 4 years ago
- REplicated STORagE☆13Updated 2 years ago
- Graph edge partitioning algorithms☆48Updated 6 years ago