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:
“Where beauty is worshipped for beauty’s sake as a goddess, independent of and superior to morality and philosophy, the most horrible putrefaction is apt to set in. The lives of the aesthetes are the far from edifying commentary on the religion of beauty.”
—Aldous Huxley (1894–1963)
“If, while watching the sun set on a used-car lot in Los Angeles, you are struck by the parallels between this image and the inevitable fate of humanity, do not, under any circumstances, write it down.”
—Fran Lebowitz (b. 1950)