Embedding complete binary trees into hypercubes

DOI10.1016/0020-0190(91)90100-VzbMath0736.68064OpenAlexW1966549320MaRDI QIDQ1178228

Ernst L. Leiss, Hari N. Reddy

Publication date: 26 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90100-v

zbMATH Keywords

hypercubebinary treesgraph embeddings

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68M99)

Related Items (2)

Compact embedding of binary trees into hypercubes ⋮ On the fault-tolerant embedding of complete binary trees in the pancake graph interconnection network

Cites Work

• Embedding all binary trees in the hypercube
• Unnamed Item

This page was built for publication: Embedding complete binary trees into hypercubes