On generalized twisted cubes

DOI10.1016/0020-0190(95)00040-JzbMath0875.68141OpenAlexW2062752592MaRDI QIDQ672501

Shawn M. Larson, Paul Cull

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

zbMATH Keywords

AlgorithmsHamiltonian cycleConnectivityHypercubeDiameterComputer architectureComplete binary treeRouting algorithms

Mathematics Subject Classification ID

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

Related Items (10)

Fault-diameter of Cartesian graph bundles ⋮ Hamiltonian properties on the class of hypercube-like networks ⋮ Edge-pancyclicity and Hamiltonian connectivity of twisted cubes ⋮ Mixed fault diameter of Cartesian graph bundles ⋮ Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles ⋮ The fault-diameter of Cartesian products ⋮ A novel algorithm to embed a multi-dimensional torus into a locally twisted cube ⋮ Wide diameter of Cartesian graph bundles ⋮ The edge fault-diameter of Cartesian graph bundles ⋮ Survey on path and cycle embedding in some networks

Cites Work

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

This page was built for publication: On generalized twisted cubes