406 search results - page 13 / 82 » Privacy-Preserving Set Union |
116
click to vote
FSTTCS
2010
Springer
15 years 27 days ago
2010
Springer
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
225
click to vote
WEA
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. The disjoint-set data structure is used to maintain a collection of non-overlapping sets of elements from a finite universe. Algorithms that operate on this data structu...
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
57
Voted
CPC
2008
15 years 3 months ago
2008
