Topological properties of the crossed cube architecture
From MaRDI portal
Publication:1349988
DOI10.1016/0167-8191(94)90130-9zbMath0875.68162OpenAlexW1984188070MaRDI QIDQ1349988
Publication date: 27 February 1997
Published in: Parallel Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-8191(94)90130-9
Hypercube architectureCrossed cube architectureMassively parallel architectureRouting algorithmTopological properties
Related Items (21)
Connectivity of the crossed cube ⋮ Node-pancyclicity and edge-pancyclicity of crossed cubes ⋮ The super connectivity of folded crossed cubes ⋮ Embedding meshes into crossed cubes ⋮ Vertex-transitivity on folded crossed cubes ⋮ Hamiltonian properties on the class of hypercube-like networks ⋮ A comment on ``Independent spanning trees in crossed cubes ⋮ Conditional fault diameter of crossed cubes ⋮ Fault-free Hamiltonian cycles in crossed cubes with conditional link faults ⋮ Constructing optimal subnetworks for the crossed cube network ⋮ The two-equal-disjoint path cover problem of matching composition network ⋮ Embedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positions ⋮ A lower bound on the number of Hamiltonian cycles through a prescribed edge in a crossed cube ⋮ Complete path embeddings in crossed cubes ⋮ A parallel algorithm for constructing two edge-disjoint Hamiltonian cycles in crossed cubes ⋮ Three completely independent spanning trees of crossed cubes with application to secure-protection routing ⋮ A two-stages tree-searching algorithm for finding three completely independent spanning trees ⋮ Optimizing Hamiltonian panconnectedness for the crossed cube architecture ⋮ MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES ⋮ The shuffle-cubes and their generalization ⋮ Independent spanning trees in crossed cubes
This page was built for publication: Topological properties of the crossed cube architecture
