On the complexity of ordinal clustering

DOI10.1007/s00357-006-0005-3zbMath1243.92043OpenAlexW2084402302MaRDI QIDQ424001

Rahul Shah, Martín Farach-Colton

Publication date: 30 May 2012

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

Full work available at URL: https://doi.org/10.1007/s00357-006-0005-3

zbMATH Keywords

phylogeneticsordinal embeddingstree metrics

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Problems related to evolution (92D15) Applications of graph theory (05C90) Probabilistic models, generic numerical methods in probability and statistics (65C20) Complexity and performance of numerical algorithms (65Y20)