4137 search results - page 75 / 828 » On the number of matchings of a tree |
ALGORITHMICA
2008
15 years 2 months ago
2008
Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...
109
click to vote
EJC
2010
15 years 2 months ago
2010
We consider plane trees whose vertices are given labels from the set {1, 2, . . . , k} in such a way that the sum of the labels along any edge is at most k + 1; it turns out that ...
109
click to vote
DM
2008
15 years 2 months ago
2008
We introduce random recursive trees, where deterministically weights are attached to the edges according to the labeling of the trees. We will give a bijection between recursive t...
102
click to vote
WWW
2006
ACM
16 years 2 months ago
2006
ACM
An XML range query may impose predicates on the numerical or textual contents of the elements and/or their respective path structures. In order to handle content and structure ran...
103
click to vote
ICPR
2010
IEEE
15 years 7 months ago
2010
IEEE
We present Transitive Closure based visual word formation technique for obtaining robust object representations from smoothly varying multiple views. Each one of our visual words ...