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)
Algorithm; Trees; Interconnection networks; Hypercubes; Emulation; Dilation; Embeddings; Expansion; porting
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
