Max weighted independent set returns a set of nodes that form the maximum weighted independent set. K-independent set returns yes/no if the graph has a independent set of size k. How would you go about proving this?
Asked
Active
Viewed 16 times
