The metric bridge partition problem: Partitioning of a metric space into two subspaces linked by an edge in any optimal realization
From MaRDI portal
Publication:1015445
DOI10.1007/s00357-007-0011-0zbMath1166.54014OpenAlexW2016102556MaRDI QIDQ1015445
Publication date: 8 May 2009
Published in: Journal of Classification (Search for Journal in Brave)
Full work available at URL: http://doc.rero.ch/lm.php?url=1000%2C43%2C9%2C20091013165829-WT/Varone_metric_bridge.pdf
Programming involving graphs or networks (90C35) Metric spaces, metrizability (54E35) Paths and cycles (05C38) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (6)
Cut points in metric spaces ⋮ The metric cutpoint partition problem ⋮ Searching for realizations of finite metric spaces in tight spans ⋮ Optimal realizations and the block decomposition of a finite metric space ⋮ Optimal realizations of two-dimensional, totally-decomposable metrics ⋮ An algorithm for computing cutpoints in finite metric spaces
This page was built for publication: The metric bridge partition problem: Partitioning of a metric space into two subspaces linked by an edge in any optimal realization