0

I stumbled upon this interesting variant of the dominating set problem lately, and as I have not been able to find a consecrated name, I suppose it has not been thoroughly studied yet.
The formulation is simple :
Given a graph $G = (V, E)$, find two dominating sets $V_1$ and $V_2$ such that $|V_1...