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:
“Most works of art are effectively treated as commodities and most artists, even when they justly claim quite other intentions, are effectively treated as a category of independent craftsmen or skilled workers producing a certain kind of marginal commodity.”
—Raymond Williams (1921–1988)
“There is nothing more mysterious than a TV set left on in an empty room. It is even stranger than a man talking to himself or a woman standing dreaming at her stove. It is as if another planet is communicating with you.”
—Jean Baudrillard (b. 1929)