A note on single-linkage equivalence

We introduce the concept of single-linkage equivalence of edge-weighted graphs, we apply it to characterise maximal spanning trees and "ultrasimilarities", and we discuss how it relates to the popular single-linkage clustering algorithm. Key words and phrases: Edge-weighted graphs, single-linkage clustering, maximal/minimal spanning trees, single-linkage equivalence, edge equivalence, ultra-similarities, ultra-metrics, subdominant ultra-metrics.

• Type: Journal
• Year: 2010
• Where: APPML
• Authors: Andreas W. M. Dress, Taoyang Wu, XiaoMing Xu
• Keywords: APPML 2010, Edge-weighted Graphs, Single-linkage Equivalence, Spanning Trees