stro21 / cliqueproblem Goto Github PK
View Code? Open in Web Editor NEWThis project forked from mlaplante1981/cliqueproblem
A polynomial time algorithm to finding the maximum clique, list of all maximal cliques and determining if a clique of size k exists for a given graph. This polynomial time solution proves that P = NP.