Optimal realizations and the block decomposition of a finite metric space
From MaRDI portal
Publication:2043363
Recommendations
- Compatible decompositions and block realizations of finite metrics
- Optimal realizations of two-dimensional, totally-decomposable metrics
- Block realizations of finite metrics and the tight-span construction. I: The embedding theorem
- On optimal realizations of finite metric spaces by graphs
- scientific article; zbMATH DE number 7703274
Cites work
- \(T\)-theory: An overview
- A canonical decomposition theory for metrics on a finite set
- An algorithm for computing cutpoints in finite metric spaces
- Block realizations of finite metrics and the tight-span construction. I: The embedding theorem
- Compatible decompositions and block realizations of finite metrics
- Cut points in metric spaces
- Distance matrix of a graph and its realizability
- Distance realization problems with applications to internet tomography
- scientific article; zbMATH DE number 3377277 (Why is no real title available?)
- On optimal embeddings of metrics in graphs
- On optimal realizations of finite metric spaces by graphs
- Searching for realizations of finite metric spaces in tight spans
- The Complexity of Metric Realization
- The metric bridge partition problem: Partitioning of a metric space into two subspaces linked by an edge in any optimal realization
- The metric cutpoint partition problem
- The polytopal structure of the tight-span of a totally split-decomposable metric
- Towards a classification of transitive group actions on finite metric spaces
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
Cited in
(4)
This page was built for publication: Optimal realizations and the block decomposition of a finite metric space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2043363)