KarlsruheMIS / KaMIS
Maximum independent sets and vertex covers of large sparse graphs.
☆73Updated 4 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☆37Updated last month
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆138Updated last week
- KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…☆456Updated 2 weeks ago
- Winning Solver of PACE Challenge 2019 Track A☆12Updated 3 years ago
- vertex cover solver☆30Updated 5 years ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆425Updated last week
- Near-linear time algorithm for computing near-maximum independent set☆18Updated 3 years ago
- CVRPController is used to run and calculate score for the 12th DIMACS Implementation Challenge: CVRP track.☆22Updated 3 years ago
- A benchmarking suite for maximum independent set solvers.☆50Updated last year
- List of Treewidth solvers, instances, and tools☆34Updated 2 years ago
- An integer linear program solver using a Lagrange decomposition into binary decision diagrams. Lagrange multipliers are updated through d…☆58Updated 10 months ago
- A standalone local search solver for general integer linear programming☆16Updated 8 months ago
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆13Updated last year
- DRL models for graph partitioning and sparse matrix ordering.☆30Updated last year
- PyTorch implementation of NeuroSAT☆28Updated last year
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 4 months ago
- Machine Learning for Combinatorial Optimization - NeurIPS'21 competition☆131Updated 2 years ago
- Implementation of the HYPE hypergraph partitioner.☆19Updated 5 years ago
- Exact Combinatorial Optimization with Graph Convolutional Neural Networks (NeurIPS 2019)☆367Updated 3 years ago
- Simplifying Experimental Algorithmics☆17Updated 4 months ago
- ☆152Updated last year
- A solver for subgraph isomorphism problems, based upon a series of papers by subsets of McCreesh, Prosser, and Trimble.☆74Updated last month
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆38Updated this week
- GBBS: Graph Based Benchmark Suite☆204Updated 3 months ago
- ☆10Updated 2 years ago
- A small but efficient C++ library for computing (customized) tree and hypertree decompositions.☆52Updated last year
- Official Repository for the ICLR 2022 paper "Generalization of Neural Combinatorial Solvers through the Lens of Adversarial Robustness"☆14Updated 2 years ago
- Isomorphism testing and automorphisms of graphs☆64Updated 6 months ago
- Overview website for research on Algorithms with Predictions (ALPS)☆40Updated last week
- Extensible Combinatorial Optimization Learning Environments☆338Updated 2 years ago