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 ...

Reduced NP‑Hard problems such as K‑Colorability, K‑clique, Maximum clique to SAT problem using Weighted Partial Max‑SAT Input format,created using boolean formulas, in order to find a satisfying ...