KarlsruheMIS / KaMIS
Maximum independent sets and vertex covers of large sparse graphs.
☆73Updated 3 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 week
- A benchmarking suite for maximum independent set solvers.☆49Updated last year
- A standalone local search solver for general integer linear programming☆16Updated 7 months ago
- Near-linear time algorithm for computing near-maximum independent set☆18Updated 2 years ago
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆137Updated this week
- CVRPController is used to run and calculate score for the 12th DIMACS Implementation Challenge: CVRP track.☆22Updated 3 years ago
- Winning Solver of PACE Challenge 2019 Track A☆13Updated 3 years ago
- A standalone local search solver for general mixed integer programming☆19Updated 2 months ago
- An integer linear program solver using a Lagrange decomposition into binary decision diagrams. Lagrange multipliers are updated through d…☆57Updated 9 months ago
- DRL models for graph partitioning and sparse matrix ordering.☆29Updated last year
- KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…☆447Updated 2 months ago
- Repository for MetaVC -- A Meta Local Search Framework For Minimum Vertex Cover (MinVC)☆10Updated 3 years ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆418Updated this week
- vertex cover solver☆30Updated 5 years ago
- Home of ALP/GraphBLAS and ALP/Pregel, featuring shared- and distributed-memory auto-parallelisation of linear algebraic and vertex-centri…☆25Updated 2 weeks ago
- Malleable Load Balancer. Massively Parallel Logic Backend. Award-winning SAT solving for the cloud.☆64Updated this week
- [ICLR 2023 spotlight] "On Representing Linear Programs by Graph Neural Networks" by Ziang Chen, Jialin Liu, Xinshang Wang, Jianfeng Lu, W…☆30Updated last year
- A solver for subgraph isomorphism problems, based upon a series of papers by subsets of McCreesh, Prosser, and Trimble.☆72Updated this week
- Management of Benchmark Instances and Instance Attributes☆18Updated 3 months ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 3 months ago
- Simplifying Experimental Algorithmics☆17Updated 2 months ago
- A C++ Library for Influence Maximization☆32Updated 2 months ago
- Hybrid Models for Learning to Branch (NeurIPS 2020)☆49Updated 3 years ago
- The top three SAT solvers of 2021: kissat-MAB, lstech_maple, and kissat_gb.☆21Updated 3 years ago
- Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".☆97Updated last year
- Representing CP problems as graphs☆17Updated last month
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆13Updated last year
- ☆148Updated last year
- A solver based on column generation☆26Updated last month
- Sequential object-oriented simPlex☆62Updated this week