✦ LIBER ✦

Voronoi trees and clustering problems

✍ Scribed by F Dehne; H Noltemeier

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 370 KB
Volume: 12
Category: Article
ISSN: 0959-2954
DOI: 10.1016/0306-4379(87)90041-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximations to clustering and subgrap

Approximations to clustering and subgraph problems on trees

✍ Rainer Schrader 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 537 KB

Voronoi polyhedra and the docking proble

Voronoi polyhedra and the docking problem

✍ Carl W. David 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 252 KB

Voronoi polyhedra, used in past work to mensurate volumes and areas of molecules, are here applied to the docking problem in biology, indicating a future use for these polyhedra in studying biological interactions.

NP-hard problems in hierarchical-tree cl

NP-hard problems in hierarchical-tree clustering

✍ Mirko Křivánek; Jaroslav Morávek 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 463 KB

PLS-trees®, a top-down clustering approa

PLS-trees®, a top-down clustering approach

✍ Lennart Eriksson; Johan Trygg; Svante Wold 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 1009 KB

The clustering matroid and the optimal c

The clustering matroid and the optimal clustering tree

✍ Ephraim Korach; Michal Stern 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 290 KB

The geometric generalized minimum spanni

The geometric generalized minimum spanning tree problem with grid clustering

✍ Corinne Feremans; Alexander Grigoriev; René Sitters 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 212 KB