This material may consist of step-by-step explanations on how to solve a problem or examples of proper writing, including the use of citations, references, bibliographies, and formatting. This material is made available for the sole purpose of studying and learning - misuse is strictly forbidden.
Yes, 3-CLIQUE problem is in P. Since it is a particular case of the more general problem (k-CLIQUE – which is NP-Complete) where k is a constant and is not part of the input (in that case it would be a function of n), it can be designed a brute-force algorithm in the following way:
- take each sub-graph with 3 vertices that can be formed from the original graph;
- verify whether it can be found a clique in each sub-graph....
This is only a preview of the solution. Please use the purchase button to see the entire solution