With this project we researched, implemented and analyzed different algorithms to effectively and efficiently solve an NP-Complete problem such as the Minimum Vertex Cover (MVC).
-
Updated
Jan 11, 2023 - Python
With this project we researched, implemented and analyzed different algorithms to effectively and efficiently solve an NP-Complete problem such as the Minimum Vertex Cover (MVC).
Minimal Hitting Set Solver with and without optimizations
A collection of useful algorithms I am learning or have learnt and implemented to further develop my understanding!
Add a description, image, and links to the np-complete-problems topic page so that developers can more easily learn about it.
To associate your repository with the np-complete-problems topic, visit your repo's landing page and select "manage topics."