The Euclidean distortion of complete binary trees

DOI10.1007/S00454-002-2827-ZMaRDI QIDQ1864125zbMATH OpenOpenAlexFDO

Authors Nathan Linial, Michael Saks

Publication date 17 March 2003

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00454-002-2827-z

zbMATH Keywords

embedding

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Optimal distortion embedding of complete binary trees into lines
• Distortion of embeddings of binary trees into diamond graphs
• Low distortion Euclidean embeddings of trees
• scientific article; zbMATH DE number 1775401
• scientific article; zbMATH DE number 1161281
• On the rotation distance between binary trees
• On the upper bound on the rotation distance of binary trees
• Lower bounds on the rotation distance of binary trees
• Finding Eulerian cycle decompositions and the rotation distance between binary trees
• Embedding of trees in Euclidean spaces

Cited in

(8)

• Yet another short proof of Bourgain's distortion estimate for embedding of trees into uniformly convex Banach spaces
• Compression of uniform embeddings into Hilbert space.
• scientific article; zbMATH DE number 2084288 (Why is no real title available?)
• Optimal distortion embedding of complete binary trees into lines
• Old and new challenges in Hadamard spaces
• Distortion lower bounds for line embeddings
• An introduction to the Ribe program
• Distortion in the metric characterization of superreflexivity in terms of the infinite binary tree

This page was built for publication: The Euclidean distortion of complete binary trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1864125)