Can I find the subsets of a domain given two sets
I've two sets, X and Y. Sample data is in this shared PDF:
I want to divide the set X (or Y) so that I can get Set X1(A,B) and Set X2(C,D). Is it possible to do this mathematically (If yes, I'll try to code in Software which is my ultimate goal).
I may want to divide it 'n' times (instead of 2, as in example) so that I can deal with manageable data.
For those who are interested, I'll be applying Hungarian Matching algorithm on the divided sets. As of now, the data is huge and even optimal implementations take huge amount of memory (which we don't have).