Efficient embeddings of ternary trees into hypercubes.
From MaRDI portal
Publication:1398807
DOI10.1016/S0743-7315(03)00037-6zbMath1035.68081MaRDI QIDQ1398807
Publication date: 7 August 2003
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (6)
Embedding Circulant Networks into Butterfly and Benes Networks ⋮ Embedding certain height-balanced trees and complete \(p^m\)-ary trees into hypercubes ⋮ Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes with faulty elements ⋮ Embedding of hypercubes into necklace, windmill and snake graphs ⋮ Bothway embedding of circulant network into grid ⋮ Embedding of the folded hypercubes into tori
This page was built for publication: Efficient embeddings of ternary trees into hypercubes.
