Nondeterministic Algorithm for K-Clique Problem

Write a nondeterministic solution of K-Clique.

First of all, there is needed to outline some aspects involving problems belonging to NP (NP-Hard) class. As a parenthesis, NP stands for nondeterministic polynomial time algorithm which refers to the fact of discovering a nondeterministic Turing machine able to solve the problem in cause within a polynomial number of discovering nondeterministic movements.

Usually the pattern for NP has two steps: “guessing” solution and proving correctness....

This is only a preview of the solution. Please use the purchase button to see the entire solution