A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube

DOI10.1016/j.ins.2010.08.029zbMath1213.68071OpenAlexW2017341788MaRDI QIDQ621616

Chia-Jui Lai, Chang-Hsiung Tsai, Hong-Chun Hsu, Tseng-Kui Li

Publication date: 28 January 2011

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

Full work available at URL: https://doi.org/10.1016/j.ins.2010.08.029

zbMATH Keywords

interconnection networklinear-time algorithmmesh embeddingtorus embeddinghypercube embeddingreflected edge label sequence

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39) Mathematical problems of computer architecture (68M07)

Related Items (4)

Paths and cycles identifying vertices in twisted cubes ⋮ Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes ⋮ The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks ⋮ Constructing completely independent spanning trees in crossed cubes

Cites Work

• Unnamed Item
• Node-pancyclicity and edge-pancyclicity of crossed cubes
• Embedding of meshes in Möbius cubes
• Embedding a family of meshes into twisted cubes
• Embedding a family of disjoint multi-dimensional meshes into a crossed cube
• Fault-tolerant cycle-embedding of crossed cubes
• Embedding a family of disjoint 3D meshes into a crossed cube
• Embedding meshes into crossed cubes
• Constructing the nearly shortest path in crossed cubes
• Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
• Embedding binary trees into crossed cubes

This page was built for publication: A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube