Independent Set (graph Theory) - Finding Independent Sets

Finding Independent Sets

Further information: Clique problem

In computer science, several computational problems related to independent sets have been studied.

  • In the maximum independent set problem, the input is an undirected graph, and the output is a maximum independent set in the graph. If there are multiple maximum independent sets, only one need be output.
  • In the maximum-weight independent set problem, the input is an undirected graph with weights on its vertices and the output is an independent set with maximum total weight. The maximum independent set problem is the special case in which all weights are one.
  • In the maximal independent set listing problem, the input is an undirected graph, and the output is a list of all its maximal independent sets. The maximum independent set problem may be solved using as a subroutine an algorithm for the maximal independent set listing problem, because the maximum independent set must be included among all the maximal independent sets.
  • In the independent set decision problem, the input is an undirected graph and a number k, and the output is a Boolean value: true if the graph contains an independent set of size k, and false otherwise.

The first three of these problems are all important in practical applications; the independent set decision problem is not, but is necessary in order to apply the theory of NP-completeness to problems related to independent sets.

The independent set problem and the clique problem are complementary: a clique in G is an independent set in the complement graph of G and vice versa. Therefore, many computational results may be applied equally well to either problem. For example, the results related to the clique problem have the following corollaries:

  • The decision problem is NP-complete, and hence it is not believed that there is an efficient algorithm for solving it.
  • The maximum independent set problem is NP-hard and it is also hard to approximate.

Read more about this topic:  Independent Set (graph Theory)

Famous quotes containing the words finding, independent and/or sets:

    “One of the annoying things about believing in free will and individual responsibility is the difficulty of finding somebody to blame your problems on. And when you do find somebody, it’s remarkable how often his picture turns up on your driver’s license.”
    —P.J. (Patrick Jake)

    “It is so rare to meet with a man outdoors who cherishes a worthy thought in his mind, which is independent of the labor of his hands. Behind every man’s busy-ness there should be a level of undisturbed serenity and industry, as within the reef encircling a coral isle there is always an expanse of still water, where the depositions are going on which will finally raise it above the surface.”
    —Henry David Thoreau (1817–1862)

    “To the extent to which genius can be conjoined with a merely good human being, Haydn possessed genius. He never exceeds the limits that morality sets for the intellect; he only composes music which has “no past.””
    —Friedrich Nietzsche (1844–1900)