Revision as of 00:54, 29 October 2016 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,852 edits →Correctness: add a more general overview paragraph ← Previous edit		Revision as of 00:56, 29 October 2016 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,852 edits m →Distances sensitive to merge order: split long sentence Next edit →
Line 172: ===Distances sensitive to merge order=== The above presentation explicitly disallowed distances sensitive to merge order;. ~~indeed~~Indeed, allowing such distances can cause problems. In particular, there exist order-sensitive cluster distances which satisfy reducibility, but for which the above algorithm will return a hierarchy with suboptimal costs.<ref>{{citation \| last= Müllner \| first=Daniel

Nearest-neighbor chain algorithm: Difference between revisions