59 search results - page 3 / 12 » A distributional study of the path edge-covering numbers for... |
SIAMDM
2008
13 years 5 months ago
2008
We study the variety of subtrees lying on the fringe of recursive trees and binary search trees by analyzing the distributional behavior of Xn,k, which counts the number of subtree...
CN
2006
13 years 5 months ago
2006
We first study the distribution of path duration in multi-hop wireless networks. We show that as the number of hops along a path increases, the path duration distribution can be a...
SLS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
CPC
2008
13 years 5 months ago
2008
We analyze the weighted height of random tries built from independent strings of i.i.d. symbols on the finite alphabet {1, . . . , d}. The edges receive random weights whose distr...
RSA
2011
12 years 8 months ago
2011
We consider a conditioned Galton–Watson tree and prove an estimate of the number of pairs of vertices with a given distance, or, equivalently, the number of paths of a given leng...