Posts classified under: General

Given a graph G, a dominating set of G is a subset of vertices S such that every vertex not in S is adjacent to at least one vertex in S; that is, NG = V(G). While classical studies focus on finding the smallest dominating set of G, our focus shifts to finding the maximum … Continue reading Séminaire Algorithmique : « Packing many dominating sets in a graph », François Pirot (LISN, Univ. Paris-Saclay)