On the fault-tolerant embeddings of complete binary trees in the mesh interconnection networks

DOI10.1016/S0020-0255(02)00389-4zbMath1012.68531MaRDI QIDQ1810462

Chien-Ming Wang, Wei-Chen Fang, Chiun-Chieh Hsu

Publication date: 9 June 2003

Published in: Information Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (7)

Longest fault-free paths in hypercubes with vertex faults ⋮ Embedding meshes into crossed cubes ⋮ \((2n-3)\)-fault-tolerant Hamiltonian connectivity of augmented cubes \(AQ_n\) ⋮ Complete binary trees embeddings in Möbius cubes ⋮ Embedding of meshes in Möbius cubes ⋮ Embedding a family of meshes into twisted cubes ⋮ Fault-Tolerant Panconnectivity of Augmented Cubes AQn

Cites Work

• \(O(\log n)\) numerical algorithms on a mesh with wormhole routing
• Embeddings of star graphs into optical meshes without bends
• ``Hypermeshes: Optical interconnection networks for parallel computing

This page was built for publication: On the fault-tolerant embeddings of complete binary trees in the mesh interconnection networks