A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube

DOI10.1006/JAGM.1996.0018MaRDI QIDQ4876698zbMATH OpenOpenAlexFDO

Authors Volker Heun, Ernst W. Mayr

Publication date 6 May 1996

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/83a724d5fb3f2abf0cda51e6772017a5dcef3747

zbMATH Keywords

binary hypercubeparallel computation

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Efficient Dynamic Embeddings of Binary Trees into Hypercubes
• Optimal dynamic embeddings of complete binary trees into hypercubes
• Efficient Embeddings of Trees in Hypercubes
• Compact embedding of binary trees into hypercubes
• Embedding complete binary trees into hypercubes
• Efficient embeddings of ternary trees into hypercubes.
• On Oriented Embedding of the Binary Tree into the Hypercube
• scientific article; zbMATH DE number 1047713
• Embedding large complete binary trees in hypercubes with load balancing
• scientific article; zbMATH DE number 1472115

Cited in

(9)

• Embedding large complete binary trees in hypercubes with load balancing
• Efficient Dynamic Embeddings of Binary Trees into Hypercubes
• scientific article; zbMATH DE number 4064517 (Why is no real title available?)
• Fibonacci hypercube
• scientific article; zbMATH DE number 140144 (Why is no real title available?)
• scientific article; zbMATH DE number 1138356 (Why is no real title available?)
• A METHOD FOR EVALUATING THE EXPECTED LOAD OF DYNAMIC TREE EMBEDDINGS IN HYPERCUBES
• On some similarity of finite sets (and what we can say today about certain old problem)
• Dense sets and embedding binary trees into hypercubes

This page was built for publication: A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube

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