Fast hierarchical clustering and other applications of dynamic closest pairs

David Eppstein
J. Experimental Algorithmics 5(1):1–23, Jun 2000
Proc. 9th Symp. Discrete Algorithms, ACM and SIAM, Jan 1998, pp. 619–628
ACM Computing Research Repository, cs.DS/9912014
http://www.jea.acm.org/2000/EppsteinDynamic/
http://www.ics.uci.edu/~eppstein/pubs/Epp-SODA-98.pdf

Cited by:

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!