Sciweavers

COMBINATORICA
2008
123views more  COMBINATORICA 2008»
13 years 9 months ago
Counting canonical partitions in the random graph
Algorithms are given for computing the number of n-element diagonal sets and the number of n-element strongly diagonal sets of binary sequences of length at most 2n - 2. The first...
Jean A. Larson