dominating set
Sign in to saveAlso known as dominating set problem, externally stable set
a set of vertices in a node-link graph such that every vertex is either in the set or adjacent to it
Wikidata facts
- Instance of
- computational problem
- Subclass of
- set
Show 3 more facts
- Commons category
- Dominating set (graph theory)
- computational complexity
- NP-complete
- maintained by WikiProject
- WikiProject Mathematics
via Wikidata · CC0