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
via Wikidata sitelinks · CC0
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).