Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1709733 | Applied Mathematics Letters | 2010 | 4 Pages |
Abstract
We introduce the concept of single-linkage equivalence of edge-weighted graphs, we apply it to characterise maximal spanning trees and “ultra-similarities”, and we discuss how it relates to the popular single-linkage clustering algorithm.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Andreas W.M. Dress, Taoyang Wu, XiaoMing Xu,