✦ LIBER ✦

A clustering algorithm for huge trees

✍ Scribed by D. Auber; M. Delest

Book ID: 108421659
Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 326 KB
Volume: 31
Category: Article
ISSN: 0196-8858
DOI: 10.1016/s0196-8858(02)00505-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Clustering huge data sets for parametric

Clustering huge data sets for parametric PET imaging

✍ Hongbin Guo; Rosemary Renaut; Kewei Chen; Eric Reiman 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 336 KB

A graph clustering algorithm based on a

A graph clustering algorithm based on a clustering coefficient for

✍ Mariá C. V. Nascimento; André C. P. L. F. Carvalho 📂 Article 📅 2010 🏛 SciELO 🌐 English ⚖ 367 KB

A novel algorithm for data clustering

✍ Ching-Chang Wong; Chia-Chong Chen; Mu-Chun Su 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 621 KB

A transfer algorithm for hierarchical cl

A transfer algorithm for hierarchical clustering

✍ Martin Schader 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 795 KB

A randomized embedding algorithm for tre

A randomized embedding algorithm for trees

✍ Benny Sudakov; Jan Vondrák 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 335 KB

A fast algorithm for Steiner trees

✍ L. Kou; G. Markowsky; L. Berman 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 248 KB

Given an undirected distance graph G = (V, E, d) and a set S, where V is the set of vertices in G, E is the set of edges in G, d is a distance function which maps E into the set of nonnegative numbers and S___ V is a subset of the vertices of V, the Steiner tree problem is to find a tree of G that s