Reduce several arbitrary-connectivity optimization problems into maximum independent set problems on a grid
-
Updated
Apr 12, 2025 - Julia
#
maximum-independent-set
Here are 16 public repositories matching this topic...
ML4CO-Bench-101: Benchmark Machine Learning for Classic Combinatorial Problems on Graphs.
benchmark dataset generative-model maximum-independent-set cvrp tsp-problem combinatorial-optimization maximum-clique atsp diffusion-models maximum-cut consistency-models adaptive-expansion
-
Updated
May 22, 2025 - Python
Automated discovery of optimal branching rules for the branch-and-bound algorithm
-
Updated
Aug 12, 2025 - Julia
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
-
Updated
May 26, 2025 - Python
Official Implementation of the NeurIPS'23 paper 'Maximum Independent Set: Self-Training through Dynamic Programming'.
-
Updated
Nov 14, 2023 - Python
A solver for the maximum(-weight) independent set and the maximum(-weight) clique problems
-
Updated
Sep 16, 2025 - C++
This program solves the 5x5x5 brick-cube-puzzle in less than one second by transforming it to a minimal-vertex-cover problem.
-
Updated
Dec 12, 2020 - C++
Maximum independent set problem solver
-
Updated
Nov 22, 2016 - Java
Online Maximum Independent Set of Hyperrectangles
algorithms theoretical-computer-science maximum-independent-set research-paper online-algorithms competitive-analysis range-queries hyperrectangles geometric-intersection-graphs
-
Updated
Mar 19, 2024 - Jupyter Notebook
Solution to a maximum independent set problem
-
Updated
May 11, 2021 - Python
Predicting the secondary structure of RNA
-
Updated
Jun 21, 2020 - Python
Maximum Independent Set (MIS) Algorithms implented in NetLogo
-
Updated
Mar 6, 2022 - NetLogo
Maximum Independent Set Template
-
Updated
May 27, 2024 - Jupyter Notebook
Maximum independent set problem - greedy and brute force parallel algorithms
graph-algorithms boost-libraries maximum-independent-set greedy-algorithm brute-force-algorithm parallel-algorithms maximal-independent-set parallel-graph-algorithms
-
Updated
Sep 25, 2018 - C++
Dynamic programming
-
Updated
Dec 13, 2020 - Jupyter Notebook
This repository contains the code used in the CS301 (Algorithms) Project which discusses the Maximum Independent Set Problem
python algorithms optimization jupyter-notebook data-visualization graph-theory academic-project maximum-independent-set graph-analysis computational-complexity heuristic-algorithms np-hard-problems brute-force-algorithms
-
Updated
Feb 13, 2025 - Jupyter Notebook
Improve this page
Add a description, image, and links to the maximum-independent-set topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the maximum-independent-set topic, visit your repo's landing page and select "manage topics."