Optimal dynamic embeddings of complete binary trees into hypercubes

DOI10.1006/JPDC.2001.1734MaRDI QIDQ5949497zbMATH OpenOpenAlexFDO

Authors Volker Heun, Ernst W. Mayr

Publication date 22 July 2002

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.2001.1734

zbMATH Keywords

complete binary treedynamic embeddings

Mathematics Subject Classification ID

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

Recommendations

• Efficient Dynamic Embeddings of Binary Trees into Hypercubes
• Dense edge-disjoint embedding of complete binary trees in the hypercube
• Embedding of \(k\)-ary complete trees into hypercubes with uniform load
• Embedding complete binary trees into hypercubes
• Embedding the complete tree in the hypercube

Cited in

(12)

• Compact embedding of binary trees into hypercubes
• Optimal dynamic embedding of X-trees into arrays
• A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube
• Complete binary trees in folded and enhanced cubes
• scientific article; zbMATH DE number 219230 (Why is no real title available?)
• Efficient Dynamic Embeddings of Binary Trees into Hypercubes
• Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
• Complete binary trees embeddings in Möbius cubes
• On Oriented Embedding of the Binary Tree into the Hypercube
• Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
• Wirelength of hypercubes into certain trees
• A METHOD FOR EVALUATING THE EXPECTED LOAD OF DYNAMIC TREE EMBEDDINGS IN HYPERCUBES

This page was built for publication: Optimal dynamic embeddings of complete binary trees into hypercubes

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