Embedding a family of disjoint 3D meshes into a crossed cube

DOI10.1016/j.ins.2007.12.010zbMath1185.68027OpenAlexW1975223789MaRDI QIDQ1031688

Juan Zhao, Yuan Yan Tang, Qiang Dong, Xiaofan Yang

Publication date: 30 October 2009

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

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

zbMATH Keywords

expansiondilationinterconnection networkgraph embeddingcrossed cube3D mesh

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (14)

A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube ⋮ Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes ⋮ Embedding a long fault-free cycle in a crossed cube with more faulty nodes ⋮ The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks ⋮ An optimal time algorithm for minimum linear arrangement of chord graphs ⋮ Constructing completely independent spanning trees in crossed cubes ⋮ A novel algorithm to embed a multi-dimensional torus into a locally twisted cube ⋮ Embedding meshes into twisted-cubes ⋮ Embedding a family of disjoint multi-dimensional meshes into a crossed cube ⋮ Embedding of tori and grids into twisted cubes ⋮ The triangular pyramid: Routing and topological properties ⋮ On embedding subclasses of height-balanced trees in hypercubes ⋮ Embedding meshes/tori in faulty crossed cubes ⋮ MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES

Cites Work

• Connectivity of the crossed cube
• Fault-tolerant cycle-embedding of crossed cubes
• Paths in Möbius cubes and crossed cubes
• 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
• Unnamed Item

This page was built for publication: Embedding a family of disjoint 3D meshes into a crossed cube