An Algorithm for Computing Virtual Cut Points in Finite Metric Spaces

DOI10.1007/978-3-540-73556-4_3MaRDI QIDQ3611945zbMATH OpenOpenAlexFDO

Authors Andreas W. M. Dress, Katharina T. Huber, Jack H. Koolen, Vincent 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

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Taxonomy, cladistics, statistics in mathematical biology (92B10)

Recommendations

• An algorithm for computing cutpoints in finite metric spaces
• Cut points in metric spaces
• scientific article; zbMATH DE number 140138
• Generalizations of finite metrics and cuts
• Construction of some computational algorithms on finite sets of points in the plane
• scientific article; zbMATH DE number 1567905
• Computational fixed points in graphical rectangular metric spaces with application
• The metric cutpoint partition problem
• Computations of metric/cut polyhedra and their relatives
• Computing the map of geometric minimal cuts

Cited in

(7)

• Barriers in metric spaces
• Functorial hierarchical clustering with overlaps
• Injective metrizability and the duality theory of cubings
• An algorithm for computing cutpoints in finite metric spaces
• The metric cutpoint partition problem
• Block realizations of finite metrics and the tight-span construction. I: The embedding theorem
• Cut points in metric spaces

This page was built for publication: An Algorithm for Computing Virtual Cut Points in Finite Metric Spaces

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