✦ LIBER ✦

Consistent formulas for estimating the total lengths of trees

✍ Scribed by Stephen J. Willson

Book ID: 108112518
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 304 KB
Volume: 148
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2005.03.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximum tree: a consistent estimator of

Maximum tree: a consistent estimator of the species tree

✍ Liang Liu; Lili Yu; Dennis K. Pearl 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 290 KB

Two kinds of hook length formulas for co

Two kinds of hook length formulas for complete -ary trees

✍ Yidong Sun; Huajun Zhang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 409 KB

Consistency of the Unlimited BIC Context

Consistency of the Unlimited BIC Context Tree Estimator

✍ Garivier, A. 📂 Article 📅 2006 🏛 IEEE 🌐 English ⚖ 328 KB

Yet Another Generalization of Postnikov'

Yet Another Generalization of Postnikov's Hook Length Formula for Binary Trees

✍ Han, Guo-Niu 📂 Article 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 123 KB

Formulas for the Hyper-Wiener Index of T

Formulas for the Hyper-Wiener Index of Trees

✍ Lukovits, Istvan 📂 Article 📅 1994 🏛 American Chemical Society 🌐 English ⚖ 342 KB

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