KarlsruheMIS / KaMISLinks
Maximum independent sets and vertex covers of large sparse graphs.
☆76Updated 2 months ago
Alternatives and similar repositories for KaMIS
Users that are interested in KaMIS are comparing it to the libraries listed below
Sorting:
- KaGen: Communication-free Massively Distributed Graph Generators☆38Updated 3 weeks ago
- Near-linear time algorithm for computing near-maximum independent set☆18Updated 3 years ago
- A benchmarking suite for maximum independent set solvers.☆51Updated last year
- 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
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆142Updated 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…☆10Updated 2 years ago
- KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…☆464Updated 2 months ago
- An integer linear program solver using a Lagrange decomposition into binary decision diagrams. Lagrange multipliers are updated through d…☆59Updated last year
- A standalone local search solver for general mixed integer programming☆22Updated 3 months ago
- A standalone local search solver for general integer linear programming☆16Updated 10 months ago
- Simplifying Experimental Algorithmics☆17Updated last month
- vertex cover solver☆30Updated 5 years ago
- A solver for subgraph isomorphism problems, based upon a series of papers by subsets of McCreesh, Prosser, and Trimble.☆81Updated this week
- A small but efficient C++ library for computing (customized) tree and hypertree decompositions.☆55Updated last year
- DRL models for graph partitioning and sparse matrix ordering.☆30Updated last year
- Generators for Combinatorial Optimization☆18Updated 2 years ago
- Exact Combinatorial Optimization with Graph Convolutional Neural Networks (NeurIPS 2019)☆377Updated 3 years ago
- ☆155Updated last year
- Fork of the Concorde TSP solver with an easier build procedure☆14Updated last year
- An open implementation of the MC family of maximum clique algorithms☆12Updated 8 years ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆435Updated last month
- Exactcolors is a collection of algorithms for exactly solving graph coloring and weighted stable set problems.☆13Updated 2 years ago
- Isomorphism testing and automorphisms of graphs☆65Updated 8 months ago
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆13Updated last year
- Official Repository for the ICLR 2022 paper "Generalization of Neural Combinatorial Solvers through the Lens of Adversarial Robustness"☆14Updated 2 years ago
- Branch-Cut-Price Framework☆30Updated 4 years ago
- Steiner tree solver☆30Updated 7 years ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 2 months ago
- Parallel Presolve for Integer and Linear Optimization☆72Updated 3 weeks ago