Two results on linear embeddings of complete binary trees

DOI10.1016/0304-3975(94)00036-IMaRDI QIDQ1367522zbMATH OpenFDO

Authors Marek Chrobak, Wojciech Rytter

Publication date 22 September 1997

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

naive embedding

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Optimal two-sided embeddings of complete binary trees in rectangular grids
• scientific article; zbMATH DE number 219230
• Optimal distortion embedding of complete binary trees into lines
• Optimal embedding of complete binary trees into lines and grids

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A Minimum Linear Arrangement Algorithm for Undirected Trees
• Fast geometric approximation techniques and geometric embedding problems
• On optimal linear arrangements of trees

Cited in

(5)

• Optimal distortion embedding of complete binary trees into lines
• Embeddings of binary trees in lines
• A binary embedding of the stable line-breaking construction
• Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
• Optimal leaf ordering of complete binary trees

This page was built for publication: Two results on linear embeddings of complete binary trees

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