Embedding the complete tree in the hypercube

DOI10.1006/JPDC.1994.1023MaRDI QIDQ1325976zbMATH OpenOpenAlexFDO

Authors A. S. Wagner

Publication date 26 January 1995

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

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

zbMATH Keywords

spanning treemultiprocessorscomplete binary treedivide-and-conquer algorithmsBoolean hypercubetree-structured computation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Network design and communication in computer systems (68M10)

Recommendations

• Embedding complete binary trees into hypercubes
• Dense edge-disjoint embedding of complete binary trees in the hypercube
• Compact embedding of binary trees into hypercubes

Cited in

(17)

• Embedding certain height-balanced trees and complete p^m-ary trees into hypercubes
• Embedding a subclass of trees into hypercubes
• Embedding hyperpyramids into hypercubes
• Compact embedding of binary trees into hypercubes
• Dense edge-disjoint embedding of complete binary trees in the hypercube
• Embedding height balanced trees and Fibonacci trees in hypercubes
• Dense sets and embedding binary trees into hypercubes
• Spanning Balanced Trees in Boolean Cubes
• On embedding of certain recursive trees and stars into hypercube
• Complete binary trees in folded and enhanced cubes
• Embeddings Between Hypercubes and Hypertrees
• Optimal dynamic embeddings of complete binary trees into hypercubes
• Embeddings on a Boolean cube
• Embedding Trees in a Hypercube is NP-Complete
• Embeddings and other mappings of rooted trees into complete trees
• Embedding complete ternary trees into hypercubes
• Embedding complete trees into the hypercube

This page was built for publication: Embedding the complete tree in the hypercube

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