A java project that calculates the maximal clique in Hamming graphs.
-
Updated
Jun 1, 2023 - Java
A java project that calculates the maximal clique in Hamming graphs.
University algorithm-oriented project that accurately detects complex networks of influential mafia families represented as vertices and edges of rare graphs. The algorithms are being reduced to the Satisfiability Problem using a boolean formula that will be evaluated by an SAT Solver, deciding whether the initial clause has been satisfied or not.
Add a description, image, and links to the maximal-cliques topic page so that developers can more easily learn about it.
To associate your repository with the maximal-cliques topic, visit your repo's landing page and select "manage topics."