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
Also 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