Abstract
In this note, we consider algorithms for computing virtual cut points in finite metric spaces and explain how these points can be used to study compatible decompositions of metrics generalizing the well-known decomposition of a tree metric into a sum of pairwise compatible split metrics. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Dress, A. W. M., Huber, K. T., Koolen, J., & Moulton, V. (2007). An algorithm for computing virtual cut points in finite metric spaces. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4616 LNCS, pp. 4–10). Springer Verlag. https://doi.org/10.1007/978-3-540-73556-4_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
