KarlsruheMIS / KaMIS
Maximum independent sets and vertex covers of large sparse graphs.
☆73Updated 2 months ago
Alternatives and similar repositories for KaMIS:
Users that are interested in KaMIS are comparing it to the libraries listed below
- KaGen: Communication-free Massively Distributed Graph Generators☆35Updated last week
- Near-linear time algorithm for computing near-maximum independent set☆18Updated 2 years ago
- KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…☆442Updated 2 months ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆413Updated this week
- vertex cover solver☆30Updated 5 years ago
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆134Updated this week
- Winning Solver of PACE Challenge 2019 Track A☆13Updated 3 years ago
- A benchmarking suite for maximum independent set solvers.☆49Updated 11 months ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 2 months ago
- An integer linear program solver using a Lagrange decomposition into binary decision diagrams. Lagrange multipliers are updated through d…☆57Updated 8 months ago
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆13Updated last year
- Repository for MetaVC -- A Meta Local Search Framework For Minimum Vertex Cover (MinVC)☆10Updated 3 years ago
- Implementation of the HYPE hypergraph partitioner.☆18Updated 5 years ago
- ☆146Updated 11 months ago
- GBBS: Graph Based Benchmark Suite☆202Updated last month
- CVRPController is used to run and calculate score for the 12th DIMACS Implementation Challenge: CVRP track.☆22Updated 3 years ago
- A standalone local search solver for general integer linear programming☆16Updated 6 months ago
- PyTorch implementation of NeuroSAT☆27Updated last year
- A solver for subgraph isomorphism problems, based upon a series of papers by subsets of McCreesh, Prosser, and Trimble.☆72Updated this week
- DRL models for graph partitioning and sparse matrix ordering.☆29Updated last year
- Simplifying Experimental Algorithmics☆17Updated last month
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆38Updated this week
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆24Updated 2 years ago
- Official Repository for the ICLR 2022 paper "Generalization of Neural Combinatorial Solvers through the Lens of Adversarial Robustness"☆14Updated 2 years ago
- A small but efficient C++ library for computing (customized) tree and hypertree decompositions.☆50Updated last year
- ☆10Updated last year
- Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.☆12Updated this week
- Parallel Presolve for Integer and Linear Optimization☆67Updated last week
- Malleable Load Balancer. Massively Parallel Logic Backend. Award-winning SAT solving for the cloud.☆63Updated this week
- A standalone local search solver for general mixed integer programming☆18Updated last month