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:

    “In the middle years of childhood, it is more important to keep alive and glowing the interest in finding out and to support this interest with skills and techniques related to the process of finding out than to specify any particular piece of subject matter as inviolate.”
    —Dorothy H. Cohen (20th century)

    “The dignity and stability of government in all its branches, the morals of the people, and every blessing of society, depend so much upon an upright and skilful administration of justice, that the judicial power ought to be distinct from both the legislative and executive, and independent upon both, that so it may be a check upon both, as both should be checks upon that.”
    —Thomas Jefferson (1743–1826)

    “In my dealing with my child, my Latin and Greek, my accomplishments and my money stead me nothing; but as much soul as I have avails. If I am wilful, he sets his will against mine, one for one, and leaves me, if I please, the degradation of beating him by my superiority of strength. But if I renounce my will, and act for the soul, setting that up as umpire between us two, out of his young eyes looks the same soul; he reveres and loves with me.”
    —Ralph Waldo Emerson (1803–1882)