Honeycomb tori are Hamiltonian

The honeycomb torus is an alternative to the usual torus networks commonly used in parallel architectures. In this paper, we present algorithms for constructing Hamiltonian cycles in honeycomb tori. Such algorithms can be used to embed many structures into the honeycomb tori to provide efficient com...

Full description

Saved in:
Bibliographic Details
Published inInformation processing letters Vol. 72; no. 3; pp. 99 - 103
Main Authors Megson, G.M., Yang, Xiaofan, Liu, Xiaoping
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 26.11.1999
Elsevier Science
Elsevier Sequoia S.A
Subjects
Algorithms
Applied sciences
Combinatorics
Combinatorics. Ordered structures
Computer architecture
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Exact sciences and technology
Graph embedding
Graph theory
Graphs
Hamiltonian cycle
Honeycomb torus
Information processing
Interconnection networks
Mathematics
Sciences and techniques of general use
Software
Studies
Theory
Honeycomb torus
Graph embedding
Hamiltonian cycle
Interconnection networks
Interconnection network
Computer network
VLSI
Torus
Embedding
Graph theory
Honeycomb
Online AccessGet full text

Cover

More Information
Summary:The honeycomb torus is an alternative to the usual torus networks commonly used in parallel architectures. In this paper, we present algorithms for constructing Hamiltonian cycles in honeycomb tori. Such algorithms can be used to embed many structures into the honeycomb tori to provide efficient communication.
ISSN:0020-0190
1872-6119
DOI:10.1016/S0020-0190(99)00141-6