Maximum set cover of graph -
i have universal set , number of sets s. need find maximum number of sets s such there no common element between choosen 2 sets.
my approch--- have consider each sets in s node , if there common element between 2 sets there edge between these 2 sets.this approach works fine if constructed graph bipartite .. have difficulty solve if constructed graph not bipartite.
p.s.-choosen sets not cover element universal set. should return maximum number of sets no adjacent.
thanks
Comments
Post a Comment