Independent Set (graph Theory)
In graph theory, an independent set or stable set is a set of vertices in a graph, no two of which are adjacent. That is, it is a set I of vertices such that for every two vertices in I, there is no edge connecting the two. Equivalently, each edge in the graph has at most one endpoint in I. The size of an independent set is the number of vertices it contains.
A maximal independent set is an independent set such that adding any other vertex to the set forces the set to contain an edge.
A maximum independent set is a largest independent set for a given graph G and its size is denoted α(G). The problem of finding such a set is called the maximum independent set problem and is an NP-hard optimization problem. As such, it is unlikely that there exists an efficient algorithm for finding a maximum independent set of a graph.
Read more about Independent Set (graph Theory): Properties, Finding Independent Sets, Software For Searching Maximum Independent Set, Software For Searching Maximal Independent Set
Famous quotes containing the words independent and/or set:
“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)
“There are incalculable resources in the human spirit, once it has been set free.”
—Hubert H. Humphrey (1911–1978)