Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03315801n
Noun Concept
Categories: NP-complete problems, Computational problems in graph theory, Graph theory objects
EN
independent set  anticlique  Approximation algorithms for the maximum independent set problem  coclique  independence
EN
In graph theory, an independent set, stable set, coclique or anticlique is a set of vertices in a graph, no two of which are adjacent. Wikipedia
English:
graph theory
Definitions
Relations
Sources
EN
In graph theory, an independent set, stable set, coclique or anticlique is a set of vertices in a graph, no two of which are adjacent. Wikipedia
A set of vertices that share no edges. Wikipedia Disambiguation
Set of vertices in a graph, no two of which are adjacent Wikidata
A set of vertices of a graph, such that no pair of them are adjacent to each other; in other words, a set of vertices which are all "independent" of each other. Wiktionary
IS A
null graph
induced subgraph
HAS KIND
maximal independent set
OPPOSITE OF
clique
Wikipedia
EN
independent set (graph theory)
Wikidata
EN
independent set
Wiktionary
EN
independent set
Wikipedia Redirections
EN
anticlique, Approximation algorithms for the maximum independent set problem, coclique, independence (graph theory), independence number, independent set problem, Independent vertex set, Maximum independent-set, maximum independent set, maximum independent set problem, Vertex independent set, Vertex packing, ♯BIS, ♯IS
Wikidata Alias
EN
anticlique, coclique, independent vertex set, stable set

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License