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 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)
“This is God’s country—Why set it on fire and make it look like hell?”
—For the State of Maine, U.S. public relief program (1935-1943)