Revision as of 02:05, 13 September 2011 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,852 edits new article		Revision as of 02:25, 13 September 2011 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,852 edits m oops, forgot an authorlink Next edit →
Line 45: However, known methods for repeatedly finding the closest pair of clusters in a dynamic set of clusters either require superlinear space to maintain a [[data structure]] that can find closest pairs quickly, or they take greater than linear time to find each closest pair.<ref name="e-jea">{{citation \| last = Eppstein \| first = David \| authorlink = David Eppstein \| arxiv = cs.DS/9912014 \| issue = 1

Nearest-neighbor chain algorithm: Difference between revisions