4137 search results - page 14 / 828 » On the number of matchings of a tree |
FSTTCS
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. We propose a construction that augments the precomputation step of a regular tree pattern matching algorithm to include cost analysis. The matching device generated is a ...
ML
2008
ACM
13 years 7 months ago
2008
ACM
We address the issue of compiling ML pattern matching to compact and efficient decisions trees. Traditionally, compilation to decision trees is optimized by (1) implementing decis...
ICALP
2001
Springer
14 years 3 days ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
CPC
2010
13 years 5 months ago
2010
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
SODA
1997
ACM
13 years 9 months ago
1997
ACM
The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutati...