✦ LIBER ✦

Estimating the Cluster Tree of a Density by Analyzing the Minimal Spanning Tree of a Sample

✍ Scribed by Werner Stuetzle

Publisher: Springer
Year: 2003
Tongue: English
Weight: 934 KB
Volume: 20
Category: Article
ISSN: 0176-4268
DOI: 10.1007/s00357-003-0004-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An application of the minimal spanning t

An application of the minimal spanning tree approach to the cluster stability problem

✍ Z. Volkovich; Z. Barzily; G.-W. Weber; D. Toledano-Kitai; R. Avros 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 937 KB

Estimating the length of minimal spannin

Estimating the length of minimal spanning trees in compression of files

✍ J. Ernvall; O. Nevalainen 📂 Article 📅 1984 🏛 Springer Netherlands 🌐 English ⚖ 664 KB

Tail bound for the minimal spanning tree

Tail bound for the minimal spanning tree of a complete graph

✍ Jeong Han Kim; Sungchul Lee 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 202 KB

Suppose each edge of the complete graph K n is assigned a random weight chosen independently and uniformly from the unit interval [0; 1]. A minimal spanning tree is a spanning tree of K n with the minimum weight. It is easy to show that such a tree is unique almost surely. This paper concerns the nu

Minimal spanning trees with a constraint

Minimal spanning trees with a constraint on the number of leaves

✍ Lucinda Matos Fernandes; Luis Gouveia 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 845 KB

On the worst case of a minimal spanning

On the worst case of a minimal spanning tree algorithm for euclidean space

✍ Jyrki Katajainen 📂 Article 📅 1983 🏛 Springer Netherlands 🌐 English ⚖ 385 KB

A spanning tree expansion of the jones p

A spanning tree expansion of the jones polynomial

✍ Morwen B. Thistlethwaite 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 963 KB