All geek questions in one place

Independent scores

As you know, find the maximum independent set - NP. Is there an algorithm to find out if a given graph has an independent set of at least k vertices? Please note that we do not want to find it. We just want to know if such a thing exists.

+3
source share
1 answer

Wikipedia Quote :

In solving the problem with an independent set, the input is an undirected graph and the number k, and the output is a logical value: true if the graph contains an independent set of sizes k, and false otherwise.

NP-. , , k , k .

, NP-complete.

+2

Source: https://habr.com/ru/post/1760973/

More articles:


All Articles