Embedding metric spaces in the rectilinear plane: a six-point criterion
From MaRDI portal
Publication:1907613
DOI10.1007/BF02716581zbMath0920.51007MaRDI QIDQ1907613
Hans-Jürgen Bandelt, Victor Chepoi
Publication date: 13 February 1996
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Related Items
Fixed finite subgraph theorems in infinite weakly modular graphs ⋮ The polytopal structure of the tight-span of a totally split-decomposable metric ⋮ Embedding into \(l_{\infty }^{2}\) is easy, embedding into \(l_{\infty}^{3}\) is NP-complete ⋮ Embedding metric spaces into normed spaces and estimates of metric capacity ⋮ Embedding into the rectilinear plane in optimal \(O(n^{2})\) time ⋮ On geodesic structures of weakly median graphs. II: Compactness, the role of isometric rays
Cites Work
- Matching binary convexities
- Superextensions and the depth of median graphs
- A canonical decomposition theory for metrics on a finite set
- A bounded compactness theorem for \(L^ 1\)-embeddability of metric spaces in the plane
- Embedding Topological Median Algebras in Products of Dendrons
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Embedding metric spaces in the rectilinear plane: a six-point criterion
