๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


On the Relations Between Discrete and Co
โœ Klaus Meer ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 389 KB

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

The degree-preserving spanning tree prob
โœ Ching-Chi Lin; Gerard J. Chang; Gen-Huey Chen ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 108 KB

## 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

On the internal path length of d-dimensi
โœ Ralph Neininger; Ludger Rรผschendorf ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 241 KB

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