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

DOI10.1006/jagm.1996.0018zbMath0844.68044OpenAlexW2050958329MaRDI QIDQ4876698

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

parallel computationbinary hypercube

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)

Related Items (3)

Dense sets and embedding binary trees into hypercubes ⋮ On some similarity of finite sets (and what we can say today about certain old problem) ⋮ Fibonacci hypercube

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