Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Volker Heun, Ernst W. Mayr. A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube. J. Algorithms, 20(2):375-399, 1996.
Possibly Related PublicationsThe following publications are possibly variants of this publication: Efficient Dynamic Embedding of Arbitrary Binary Trees into HypercubesVolker Heun, Ernst W. Mayr. irregular 1996: 287-298 Optimal Dynamic Embeddings of Complete Binary Trees into HypercubesVolker Heun, Ernst W. Mayr. jpdc, 61(8):1110-1125, 2001. [doi] Efficient Dynamic Embeddings of Binary Trees into HypercubesVolker Heun, Ernst W. Mayr. jal, 43(1):51-84, 2002. [doi]
The following publications are possibly variants of this publication: