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:
“Whether changes in the sibling relationship during adolescence create long-term rifts that spill over into adulthood depends upon the ability of brothers and sisters to constantly redefine their connection. Siblings either learn to accept one another as independent individuals with their own sets of values and behaviors or cling to the shadow of the brother and sister they once knew.”
—Jane Mersky Leder (20th century)
“The eyes that drew from me such fervent praise,
The arms and hands and feet and countenance
Which made me a stranger in my own romance
And set me apart from the well-trodden ways;”
—Petrarch (1304–1374)