172 search results - page 2 / 35 » The Complexity of Unions of Disjoint Sets |
ACNS
2007
Springer
13 years 7 months ago
2007
Springer
Recently there has been a significant amount of work on privacy-preserving set operations, including: set intersection [14, 6, 21, 9], testing set disjointness [17], multi-set ope...
IPPS
1996
IEEE
13 years 9 months ago
1996
IEEE
In this paper, we study on the EREW-PRAM model a parallel solution to the extended set union problem with unlimited backtracking which maintains a dynamic partition of an n-elemen...
EJC
2002
13 years 5 months ago
2002
A cycle in a matroid is a disjoint union of circuits. This paper proves that every regular matroid M without coloops has a set S of cycles whose union is E(M) such that every elem...
CCCG
2010
13 years 6 months ago
2010
For a given point set S (in general position), two pointed pseudo-triangulations are compatible if their union is plane. We show that for any set S there exist two maximally disjo...
WG
2001
Springer
13 years 9 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...