The continuous and discrete path-variance problems on trees
โ Scribed by Justo Puerto; Federica Ricca; Andrea Scozzari
- Publisher
- John Wiley and Sons
- Year
- 2009
- Tongue
- English
- Weight
- 123 KB
- Volume
- 53
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A b s t r a c t . Relations between discrete and continuous complexity models are considered. The present paper is devoted to combine both models. In particular we analyze the 3-Satisfiability problem. The existence of fast decision procedures for this problem over the reds is examined based on cert
## Abstract Suppose __G__ is a connected graph and __T__ a spanning tree of __G__. A vertex __v__ ฮต __V__(__G__) is said to be a degreeโpreserving vertex if its degree in __T__ is the same as its degree in __G__. The degreeโpreserving spanning tree problem is to find a spanning tree __T__ of a conn
It is proved that the internal path length of a d-dimensional quad tree after normalization converges in distribution. The limiting distribution is characterized as a fixed point of a random affine operator. We obtain convergence of all moments and of the Laplace transforms. The moments of the limit