ML4CO-Bench-101: Benchmark Machine Learning for Classic Combinatorial Problems on Graphs.
Reduce several arbitrary-connectivity optimization problems into maximum independent set problems on a grid
A solver for the (unicost) set covering problem
Automated discovery of optimal branching rules for the branch-and-bound algorithm
This repository provides a collection of advanced solvers for the Maximum Independent Set (MIS) problem, leveraging various optimization techniques and tools. It includes implementations of solvers using Gurobi, Google OR-Tools, and dataless neural networks (dNNs), alongside the focus of this repo, pCQO MIS
A solver for the maximum(-weight) independent set and the maximum(-weight) clique problems
Official Implementation of the NeurIPS'23 paper 'Maximum Independent Set: Self-Training through Dynamic Programming'.
Open-source project HyperMIS - Hypergraph Maximum Independent Sets.
Fully dynamic solver for the Maximum (Weight) Independent Set problem
This program solves the 5x5x5 brick-cube-puzzle in less than one second by transforming it to a minimal-vertex-cover problem.
Maximum independent set problem solver
Solution to a maximum independent set problem
Online Maximum Independent Set of Hyperrectangles
Independent same-machine adjudication of the PI-GNN vs greedy dispute in Nature Machine Intelligence. 483 measured runs on Maximum Independent Set.
A GNN-based update mechanism for Maximum-Independent-Set in dynamic graphs
Predicting the secondary structure of RNA
Maximum Independent Set (MIS) Algorithms implented in NetLogo
Unfinished Maximum Independent Solver that utilizes the simplicial vertex reduction + greedy MIS algorithm to find... somewhat poor solutions.
Maximum independent set problem - greedy and brute force parallel algorithms
Dynamic programming
To associate your repository with the maximum-independent-set topic, visit your repo's landing page and select "manage topics."