On 9/11/06, Nat (Padmanabhan Natarajan) <
[EMAIL PROTECTED]> wrote:
I am surprised you have a linear time algorithm for this.On 9/11/06, vijay < [EMAIL PROTECTED]> wrote:
Lets say you have a given collection of subsets of a set of integers.
Given a set of integers as input, what is the most efficient way to
find out all the subsets in the collection of subsets which are also
the subsets of the given set.
A linear time solution is easy. I was wondering if there is a faster
way to do so.
So, if given sets
(1,2) (3,4) (2,3)
and given a input set of (1,2,3), i want the answer to be
(1,2) and (2,3)
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
