Here are
7 public repositories
matching this topic...
GCS-Q is a coalition structure generation algorithm for induced subgraph games
Updated
Nov 18, 2024
Jupyter Notebook
Simulated annealing which uses thermodynamics of the landscape to escape local minima and works amazingly on discrete combinatorial problems
Code written for lectures and homework in USC CSCI570-Analysis-of-Algorithms Course 🚀🚀🚀
Hvala: Approximate Vertex Cover Solver
Updated
Dec 20, 2025
Python
This repository contains the code used in the CS301 (Algorithms) Project which discusses the Maximum Independent Set Problem
Updated
Feb 13, 2025
Jupyter Notebook
Esperanza: Approximate Independent Set Solver
Updated
Mar 19, 2026
Python
Selected graph problems for MC558
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."
Learn more
You can’t perform that action at this time.