Minimum spanning trees for tree metrics: Abridgements and adjustments

DOI10.1007/BF03040856zbMath0845.62046MaRDI QIDQ1907943

Bruno Leclerc

Publication date: 25 February 1996

Published in: Journal of Classification (Search for Journal in Brave)

zbMATH Keywords

minimum spanning treedegrees of freedomtree metricscombinatorial data analysisdissimilaritiesfitting algorithmRobinson dissimilarityRobinson formultra metric

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of graph theory (05C90) Nonparametric inference (62G99)

Related Items (7)

Tree reconstruction from triplet cover distances ⋮ On the extension of a partial metric to a tree metric ⋮ The triangles method to buildX-trees from incomplete distance matrices ⋮ Recovering symbolically dated, rooted trees from symbolic ultrametrics ⋮ On some relations between 2-trees and tree metrics ⋮ Quasi-ultrametrics and their \(2\)-ball hypergraphs ⋮ \(l_\infty\)-approximation via subdominants.

Cites Work

• A note on two problems in connexion with graphs
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Recognition of Tree Metrics
• An Optimal Diagonal Tree Code
• SPANNING TREES AND ASPECTS OF CLUSTERING
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimum spanning trees for tree metrics: Abridgements and adjustments