216 search results - page 2 / 44 » A hybrid exact algorithm for complete set partitioning |
FOCS
2006
IEEE
13 years 10 months ago
2006
IEEE
Given an n-element set U and a family of subsets S ⊆ 2U we show how to count the number of k-partitions S1 ∪ · · · ∪ Sk = U into subsets Si ∈ S in time 2nnO(1). The only...
DMIN
2006
13 years 6 months ago
2006
We discovered that the set of frequent hybrid sequential patterns obtained by previous researches is incomplete, due to the inapplicability of the Apriori principle. We design and ...
ANOR
2011
12 years 11 months ago
2011
A vital task facing government agencies and commercial organizations that report data is to represent the data in a meaningful way and simultaneously to protect the confidentialit...
COMBINATORICA
2007
13 years 4 months ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
DM
2008
13 years 4 months ago
2008
A nonincreasing sequence of nonnegative integers = (d1, d2, ..., dn) is graphic if there is a (simple) graph G of order n having degree sequence . In this case, G is said to reali...