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:
“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)
“I let my neighbor know beyond the hill;
And on a day we meet to walk the line
And set the wall between us once again.
We keep the wall between us as we go.”
—Robert Frost (1874–1963)