Two results on linear embeddings of complete binary trees

DOI10.1016/0304-3975(94)00036-IzbMath0877.68085MaRDI QIDQ1367522

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)

Related Items (1)

Minimum average congestion of enhanced and augmented hypercubes into complete binary trees

Cites Work

• Unnamed Item
• On optimal linear arrangements of trees
• Fast geometric approximation techniques and geometric embedding problems
• A Minimum Linear Arrangement Algorithm for Undirected Trees

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