520 search results - page 1 / 104 » Subset Counting in Trees |
ARSCOM
2008
13 years 5 months ago
2008
Various enumeration problems for classes of simply generated families of trees have been the object of investigation in the past. We mention the enumeration of independent subsets,...
ESA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
CONSTRAINTS
2008
13 years 5 months ago
2008
The tree constraint partitions a directed graph into node-disjoint trees. In many practical applications that involve such a partition, there exist side constraints specifying requ...
COMBINATORICS
2004
13 years 5 months ago
2004
Erdos posed the problem of how many random subsets need to be chosen from a set of n elements, each element appearing in each subset with probability p = 1/2, in order that at lea...
COCOON
2011
Springer
12 years 5 months ago
2011
Springer
