121 search results - page 2 / 25 » On the degree distribution of the nodes in increasing trees |
94
Voted
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...
96
Voted
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
103
click to vote
CAAP
1992
15 years 1 months ago
1992
We extend results about heights of random trees (Devroye, 1986, 1987, 1998b). In this paper, a general split tree model is considered in which the normalized subtree sizes of node...
TC
2010
14 years 8 months ago
2010
—In this paper, we investigate data parallelism in exact inference with respect to arbitrary junction trees. Exact inference is a key problem in exploring probabilistic graphical...
111
click to vote
PDCAT
2005
Springer
15 years 3 months ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...