DocumentCode
2054832
Title
Gray codes for torus and edge disjoint Hamiltonian cycles
Author
Bae, Myung M. ; Bose, Bella
Author_Institution
Scalable POWERparallel Syst., IBM Corp., Poughkeepsie, NY, USA
fYear
2000
fDate
2000
Firstpage
365
Lastpage
370
Abstract
Lee distance Gray codes for k-ary n-cubes and torus networks are presented. Using these Lee distance Gray codes, it is further shown how to directly generate edge disjoint Hamiltonian cycles for a class of k-ary n-cubes, 2-D tori, and hypercubes
Keywords
Gray codes; hypercube networks; Gray codes; Lee distance; edge disjoint Hamiltonian cycles; hypercubes; k-ary n-cubes; torus networks; Computer science; Concurrent computing; Hypercubes; Multiprocessor interconnection networks; Network topology; Parallel machines; Reflective binary codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Processing Symposium, 2000. IPDPS 2000. Proceedings. 14th International
Conference_Location
Cancun
Print_ISBN
0-7695-0574-0
Type
conf
DOI
10.1109/IPDPS.2000.846007
Filename
846007
Link To Document