I’m trying to find the dominant set with minimum number of nodes in a graph. How can i generate all the possible Dominant sets in a graph and get the most minimum one.
Is there a greedy algorithm for the same?
I’m trying this:
Is there a way to do so optimally?