On generalized twisted cubes

DOI10.1016/0020-0190(95)00040-JzbMATH Open0875.68141OpenAlexW2062752592MaRDI QIDQ672501FDOQ672501

Authors: Paul Cull, Shawn M. Larson 

Publication date: 28 February 1997

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

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00040-j

Recommendations

• On the generalized twisted cube
• Embedding of tori and grids into twisted cubes
• The twisted-cube connected networks
• Embedding meshes into twisted-cubes
• Embedding a family of meshes into twisted cubes

zbMATH Keywords

AlgorithmsHamiltonian cycleConnectivityDiameterHypercubeComplete binary treeComputer architectureRouting algorithms

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Computer system organization (68M99)

Cites Work

• The twisted N-cube with application to multiprocessing
• A new variation on hypercubes with smaller diameter

Cited In (16)

• A novel algorithm to embed a multi-dimensional torus into a locally twisted cube
• Mixed fault diameter of Cartesian graph bundles
• The fault-diameter of Cartesian products
• Wide diameter of Cartesian graph bundles
• Title not available (Why is that?)
• The Many Lives of the Twisted Cubic
• Hamiltonian properties on the class of hypercube-like networks
• Survey on path and cycle embedding in some networks
• Fault-diameter of Cartesian graph bundles
• Edge-pancyclicity and Hamiltonian connectivity of twisted cubes
• Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles
• Title not available (Why is that?)
• The edge fault-diameter of Cartesian graph bundles
• Sporadic cubic torsion
• Title not available (Why is that?)
• The diameter of rectangular twisted torus

This page was built for publication: On generalized twisted cubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672501)