An Algorithm for Computing Virtual Cut Points in Finite Metric Spaces
From MaRDI portal
Publication:3611945
DOI10.1007/978-3-540-73556-4_3zbMath1175.05049OpenAlexW1825789935MaRDI QIDQ3611945
Andreas W. M. Dress, Katharina T. Huber, Jack H. Koolen, Vincent L. Moulton
Publication date: 3 March 2009
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73556-4_3
Trees (05C05) Taxonomy, cladistics, statistics in mathematical biology (92B10) Distance in graphs (05C12)
Related Items
Block realizations of finite metrics and the tight-span construction. I: The embedding theorem, Functorial hierarchical clustering with overlaps, Cut points in metric spaces, The metric cutpoint partition problem, Injective metrizability and the duality theory of cubings, Barriers in metric spaces, An algorithm for computing cutpoints in finite metric spaces