Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

APPML
2010

favoriteEmaildiscussreport

86views more APPML 2010»

A note on single-linkage equivalence

13 years 4 months ago

A note on single-linkage equivalence

Download www.tcs.fudan.edu.cn

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.

Andreas W. M. Dress, Taoyang Wu, XiaoMing Xu

Real-time Traffic

APPML 2010 | Edge-weighted Graphs | Single-linkage Equivalence | Spanning Trees |

claim paper

Related Content

» A note on the MIR closure and basic relaxations of polyhedra

» Yet Another Proof of the Strong Equivalence Between Propositional Theories and Logic Progr...

» Equivalent Conditions for Regularity Extended Abstract

» The Fundamental Theorem of Asset Pricing

» Generating Arithmetically Equivalent Number Fields with Elliptic Curves

» A Note on Local Morse Theory in Scale Space and Gaussian Deformations

» On the Complexity of Matroid Isomorphism Problem

» A note on Laplaces equation inside a cylinder

» A Note on Negligible Functions

Post Info
More Details (n/a)

Added	08 Dec 2010
Updated	08 Dec 2010
Type	Journal
Year	2010
Where	APPML
Authors	Andreas W. M. Dress, Taoyang Wu, XiaoMing Xu

Comments (0)