no code implementations • 28 Aug 2018 • Mayra Albuquerque, Thibaut Vidal
A minimum dominating set in a graph is a minimum set of vertices such that every vertex of the graph either belongs to it, or is adjacent to one vertex of this set.
