Search Results - "Output polynomial-time algorithm"

On the Enumeration of Minimal Dominating Sets and Related Notions by Kanté, Mamadou Moustapha, Limouzy, Vincent, Mary, Arnaud, Nourine, Lhouari

“…A dominating set ${D}$ in a graph is a subset of its vertex set such that each vertex is either in ${D}$ or has a neighbor in ${D}$. In this paper, we are…”
Get full text