KarlsruheMIS / pace-2019
Winning Solver of PACE Challenge 2019 Track A
☆13Updated 3 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☆13Updated last year
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Updated 2 months ago
- Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.☆12Updated this week
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated last month
- KaGen: Communication-free Massively Distributed Graph Generators☆38Updated last week
- Maximum independent sets and vertex covers of large sparse graphs.☆74Updated last month
- KaPoCE is a framework for solving the cluster editing problem that asks to transform an input graph into a cluster graph (a disjoint unio…☆10Updated 2 years ago
- More Hierarchy in Route Planning Using Edge Hierarchies☆15Updated 5 years ago
- vertex cover solver☆30Updated 5 years ago
- ☆17Updated last month
- Near-linear time algorithm for computing near-maximum independent set☆18Updated 3 years ago
- Paper, code, experiments and evaluation for ESA2020 paper "Space-efficient, Fast and Exact Routing in Time-dependent Road Networks"☆10Updated 4 years ago
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆140Updated last week
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆38Updated last week
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆433Updated 3 weeks ago
- GBBS: Graph Based Benchmark Suite☆208Updated 5 months ago
- ☆17Updated 5 months ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆22Updated 6 months ago
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆14Updated last month
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆24Updated last year
- KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…☆462Updated 2 months ago
- ☆11Updated last year
- Vienna Graph Clustering☆16Updated 3 months ago
- Parallel Weighted Random Sampling☆20Updated 4 years ago
- Experimental FlowCutter Code☆12Updated 5 years ago
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆20Updated 2 years ago
- Graph edge partitioning algorithms☆45Updated 5 years ago
- REplicated STORagE☆13Updated 2 years ago
- Management of Benchmark Instances and Instance Attributes☆19Updated 2 weeks ago
- Implementation of the HYPE hypergraph partitioner.☆19Updated 5 years ago