Reduce several arbitrary-connectivity optimization problems into maximum independent set problems on a grid
-
Updated
Jun 25, 2024 - Julia
Reduce several arbitrary-connectivity optimization problems into maximum independent set problems on a grid
Official Implementation of the NeurIPS'23 paper 'Maximum Independent Set: Self-Training through Dynamic Programming'.
A solver for the maximum(-weight) independent set and the maximum(-weight) clique problems
Maximum independent set problem solver
This program solves the 5x5x5 brick-cube-puzzle in less than one second by transforming it to a minimal-vertex-cover problem.
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
Solution to a maximum independent set problem
Online Maximum Independent Set of Hyperrectangles
Maximum independent set problem - greedy and brute force parallel algorithms
Predicting the secondary structure of RNA
Maximum Independent Set (MIS) Algorithms implented in NetLogo
Maximum Independent Set Template
Dynamic programming
Add a description, image, and links to the maximum-independent-set topic page so that developers can more easily learn about it.
To associate your repository with the maximum-independent-set topic, visit your repo's landing page and select "manage topics."