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:

    “What affects men sharply about a foreign nation is not so much finding or not finding familiar things; it is rather not finding them in the familiar place.”
    —Gilbert Keith Chesterton (1874–1936)

    “The ex-Presidential situation has its advantages, but with them are certain drawbacks. The correspondence is large. The meritorious demands on one are large. More independent out than in place, but still something of the bondage of the place that was willingly left. On the whole, however, I find many reasons to be content.”
    —Rutherford Birchard Hayes (1822–1893)

    “The poem has a social effect of some kind whether or not the poet wills it to have. It has kinetic force, it sets in motion ... [ellipsis in source] elements in the reader that would otherwise be stagnant.”
    —Denise Levertov (b. 1923)