Cut points in metric spaces

DOI10.1016/j.aml.2007.05.018zbMath1142.54007OpenAlexW2120321913MaRDI QIDQ926762

Katharina T. Huber, Andreas W. M. Dress, Vincent L. Moulton, Jack H. Koolen

Publication date: 21 May 2008

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2007.05.018

zbMATH Keywords

metric spacetight spancut pointblock decompositionoptimal realization

Mathematics Subject Classification ID

Metric spaces, metrizability (54E35) Connected and locally connected spaces (general aspects) (54D05)

Related Items (5)

Block realizations of finite metrics and the tight-span construction. I: The embedding theorem ⋮ Obtaining splits from cut sets of tight spans ⋮ Optimal realizations and the block decomposition of a finite metric space ⋮ Barriers in metric spaces ⋮ An algorithm for computing cutpoints in finite metric spaces

Cites Work

• The metric cutpoint partition problem
• On optimal embeddings of metrics in graphs
• Some uses of the Farris transform in mathematics and phylogenetics -- A review
• Compatible decompositions and block realizations of finite metrics
• The metric bridge partition problem: Partitioning of a metric space into two subspaces linked by an edge in any optimal realization
• Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
• \(T\)-theory: An overview
• An Algorithm for Computing Virtual Cut Points in Finite Metric Spaces

This page was built for publication: Cut points in metric spaces