446 search results - page 13 / 90 » A Combinatorial Theorem for Trees |
BIRTHDAY
2003
Springer
15 years 1 months ago
2003
Springer
We prove in this paper that if r and s are two semilinear power series in commuting variables and s has bounded coefficients, then r-s is a rational series. This result can be tho...
UAI
2001
14 years 11 months ago
2001
We study the problem of projecting a distribution onto (or finding a maximum likelihood distribution among) Markov networks of bounded tree-width. By casting it as the combinatori...
DAM
2008
14 years 9 months ago
2008
Abstract. We study for various tree families the distribution of the number of edgedisjoint paths required to cover the edges of a random tree of size n. For all tree families cons...
RSA
2006
14 years 9 months ago
2006
We study random cutting down of a rooted tree and show that the number of cuts is equal (in distribution) to the number of records in the tree when edges (or vertices) are assigned...
115
Voted
ALGORITHMICA
2006
14 years 9 months ago
2006
We use large deviations to prove a general theorem on the asymptotic edge-weighted height Hn of a large class of random trees for which Hn c log n for some positive constant c. A...