𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Estimating the length of minimal spanning trees in compression of files

✍ Scribed by J. Ernvall; O. Nevalainen

Publisher
Springer Netherlands
Year
1984
Tongue
English
Weight
664 KB
Volume
24
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Estimating the asymptotic constants of t
Estimating the asymptotic constants of the total length of Euclidean minimal spanning trees with power-weighted edges
✍ Mario Cortina-Borja; Tony Robinson πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 80 KB

Steele (1988 , Ann. Probab. 16, 1767-1787) has proved that the total length of several combinatorial optimization problems in R p involving trees with n nodes and -power-weighted edges is asymptotically c(p; )n (p-)=p , where 0 Β‘ 6p. In this paper we obtain bounds for these constants and give esti

Inapplicability of Asymptotic Results on
Inapplicability of Asymptotic Results on the Minimal Spanning Tree in Statistical Testing
✍ C. Caroni; P. Prescott πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 62 KB

Penrose has given asymptotic results for the distribution of the longest edge of the minimal spanning tree and nearest neighbour graph for sets of multivariate uniformly or normally distributed points. We investigate the applicability of these results to samples of up to 100 points, in up to 10 dime

The number of spanning trees in buckmins
The number of spanning trees in buckminsterfullerene
✍ T. J. N. Brown; R. B. Mallion; P. Pollak; Branca R. M. de Castro; J. A. N. F. Go πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 662 KB

## Abstract The theorem of Gutman et al. (1983) is applied to calculate the number of spanning trees in the carbon‐carbon connectivity‐network of the recently diagnosed C~60~‐cluster buckminsterfullerene. This β€œcomplexity” turns out to be approximately 3.75 Γ— 10^20^ and it is found necessary to inv