np-hard-problem

There are 4 repositories under np-hard-problem topic.

JSANTOS22/Max-Clique
This project contains 3 implementations to solving the maximal clique problem.
Language:C++00
Nonoxali/Vertex-cover
Naive and optimized greedy solutions to the NP-Hard Vertex cover problem with a basic GUI
Language:Python0 1 00
amatov/LineDetectionCombinatorial
Language:C++1 0
RyzinGit/Hamming-Maximal-Clique
Algorithm for finding maximal cliques in hamming graph using brute force.
Language:C++