This project contains 3 implementations to solving the maximal clique problem.
-
Updated
Apr 21, 2024 - C++
This project contains 3 implementations to solving the maximal clique problem.
Algorithm for finding maximal cliques in hamming graph using brute force.
Naive and optimized greedy solutions to the NP-Hard Vertex cover problem with a basic GUI
Add a description, image, and links to the np-hard-problem topic page so that developers can more easily learn about it.
To associate your repository with the np-hard-problem topic, visit your repo's landing page and select "manage topics."