scientific article; zbMATH DE number 912696

zbMATH Open0897.62063MaRDI QIDQ4887376FDOQ4887376

Authors: Evangelos Tabakis 

Publication date: 1 August 1996

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

clusteringminimal spanning treechainingbreakdown points

Mathematics Subject Classification ID

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

Cited In (7)

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

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)