1. Mathematics
2. Algebra
3. Graphs and Functions
4. 2338

This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

Please see the attachment below for the complete question.

We need to prove that the problem is NP -complete by reduction from Vertex-cover.
Problem :- Given a collection of sets { S1, S2 ,..., Sn} and a positive integer K. Does there exist a set T with at most K elements such that T disjoint Si not-equalto empty , 1<=i<=n ?

[we can use the edges in graph to create the sets in the collection ]