#

np-hard-problems

Here are 2 public repositories matching this topic...

GCS-Q

supreethmv / GCS-Q

GCS-Q is a coalition structure generation algorithm for induced subgraph games

optimization quantum quantum-computing np-hard complexity game-theory multi-agent-systems complexity-analysis complexity-theory quantum-annealing quantum-optimization coalition-game-theory np-hard-problem np-hard-problems

Updated Nov 18, 2024
Jupyter Notebook

Team7-2401 / MIS-Project

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 np-hard-problems topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the np-hard-problems topic, visit your repo's landing page and select "manage topics."