Embedding a family of disjoint multi-dimensional meshes into a crossed cube

DOI10.1016/j.ipl.2008.07.013zbMath1191.68033MaRDI QIDQ975501

Xiaofan Yang, Juan Zhao, Qiang Dong

Publication date: 9 June 2010

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

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.07.013

zbMATH Keywords

interconnection networks; graph embedding; crossed cube; multi-dimensional mesh

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

68W10: Parallel algorithms in computer science

Related Items

Constructing optimal subnetworks for the crossed cube network, Embedding a mesh of trees in the crossed cube, A novel algorithm to embed a multi-dimensional torus into a locally twisted cube, A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube, Embedding a long fault-free cycle in a crossed cube with more faulty nodes, Embedding of tori and grids into twisted cubes, Embedding meshes/tori in faulty crossed cubes, MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES

Cites Work

• Unnamed Item
• Connectivity of the crossed cube
• Fault-tolerant cycle-embedding of crossed cubes
• Embedding a family of disjoint 3D meshes into a crossed cube
• Paths in Möbius cubes and crossed cubes
• Embedding meshes on the star graph
• Bent Hamilton cycles in \(d\)-dimensional grid graphs
• Embedding meshes into crossed cubes
• Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
• Edge-pancyclicity and path-embeddability of bijective connection graphs
• Complete path embeddings in crossed cubes
• The Mobius cubes
• Embedding binary trees into crossed cubes
• The locally twisted cubes
• On the double-vertex-cycle-connectivity of crossed cubes