On the Hamiltonian cycle mapping onto 3-D torus interconnection network based on base-b reflected gray codes

DOI10.1016/J.AMC.2006.07.163MaRDI QIDQ884586zbMATH OpenOpenAlexFDO

Authors Saleh H. Al-Sharaeh

Publication date 6 June 2007

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2006.07.163

zbMATH Keywords

gray codesHamiltonianparallel simulationplasmaspeedup

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Binary cube emulation of butterfly networks encoded by Gray code
• An efficient algorithm for gray-to-binary permutation on hypercubes
• Interconnection networks for parallel molecular dynamics simulation based on Hamiltonian cubic symmetric topology
• A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube
• On the conversion between binary code and binary-reflected Gray code on binary cubes

Cites work

• Efficient numerical simulation for long range wave propagation
• Gray codes for reflection groups
• scientific article; zbMATH DE number 41859 (Why is no real title available?)

This page was built for publication: On the Hamiltonian cycle mapping onto 3-D torus interconnection network based on base-b reflected gray codes

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