680 search results - page 2 / 136 » A randomized embedding algorithm for trees |
SIAMDM
2010
12 years 11 months ago
2010
We prove that if T is a tree on n vertices with maximum degree and the edge probability p(n) satisfies: np C max{ log n, n } for some constant > 0, then with high probability...
TALG
2008
13 years 4 months ago
2008
TALG
2008
13 years 4 months ago
2008
We introduce a new notion of embedding, called minimum-relaxation ordinal embedding, parallel to the standard notion of minimum-distortion (metric) embedding. In an ordinal embedd...
IWOCA
2009
Springer
13 years 11 months ago
2009
Springer
Embedded trees are labelled rooted trees, where the root has zero label and where the labels of adjacent vertices differ (at most) by
WIA
2009
Springer
13 years 11 months ago
2009
Springer
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential le...