Calculating Max Independent Set with greedy algorithm
-
Updated
Nov 21, 2024 - Python
Calculating Max Independent Set with greedy algorithm
Implementation of three fundamental algorithms in graph theory and Boolean logic: Satisfiability (SAT), Clique, and Independent Set. Each problem is addressed using various optimization and search techniques.
Add a description, image, and links to the independent-set topic page so that developers can more easily learn about it.
To associate your repository with the independent-set topic, visit your repo's landing page and select "manage topics."