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:

    “Love has its own instinct, finding the way to the heart, as the feeblest insect finds the way to its flower, with a will which nothing can dismay nor turn aside.”
    —Honoré De Balzac (1799–1850)

    “There are two kinds of timidity—timidity of mind, and timidity of the nerves; physical timidity, and moral timidity. Each is independent of the other. The body may be frightened and quake while the mind remains calm and bold, and vice versë. This is the key to many eccentricities of conduct. When both kinds meet in the same man he will be good for nothing all his life.”
    —Honoré De Balzac (1799–1850)

    “Almsgiving tends to perpetuate poverty; aid does away with it once and for all. Almsgiving leaves a man just where he was before. Aid restores him to society as an individual worthy of all respect and not as a man with a grievance. Almsgiving is the generosity of the rich; social aid levels up social inequalities. Charity separates the rich from the poor; aid raises the needy and sets him on the same level with the rich.”
    —Eva Perón (1919–1952)