scientific article; zbMATH DE number 912696

MaRDI QIDQ4887376zbMATH OpenFDO

Authors Evangelos Tabakis

Publication date 1 August 1996

zbMATH Keywords

breakdown pointschainingclusteringminimal spanning tree

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Combinatorial optimization (90C27)

Recommendations

• A strong law for the longest edge of the minimal spanning tree
• Growth rates of Euclidean minimal spanning trees with power weighted edges
• The longest edge of the random minimal spanning tree
• Asymptotics for weighted minimal spanning trees on random points
• Extremes on trees

Cited in

(8)

• Probabilistic models in cluster analysis
• The longest edge of the random minimal spanning tree
• A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree.
• A strong law for the longest edge of the minimal spanning tree
• Inapplicability of asymptotic results on the minimal spanning tree in statistical testing
• Extremes on trees
• Modeling a minimal spanning tree
• On the connectivity threshold for general uniform metric spaces

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4887376)