Sciweavers

SODA
1998
ACM
113views Algorithms» more  SODA 1998»
13 years 6 months ago
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
David Eppstein