Optimal distortion embedding of complete binary trees into lines

DOI10.1016/j.ipl.2012.02.003zbMath1243.05175OpenAlexW2053324436MaRDI QIDQ436329

Masao Kumamoto, Eiji Miyano

Publication date: 20 July 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.02.003

zbMATH Keywords

combinatorial problemsdistortioncomplete binary treeoptimal boundline embedding

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

Complete binary trees embeddings in Möbius cubes

Cites Work

• Unnamed Item
• Unnamed Item
• Distortion lower bounds for line embeddings
• Optimal embedding of complete binary trees into lines and grids
• Approximating the bandwidth via volume respecting embeddings
• Embedding tree metrics into low dimensional Euclidean spaces
• Low-distortion embeddings of general metrics into the line

This page was built for publication: Optimal distortion embedding of complete binary trees into lines