Copyright © 1999 Published by Elsevier Science B.V. All rights reserved.
Honeycomb tori are Hamiltonian*1
Received 22 January 1999;
revised 5 October 1999.
Communicated by C. Morgan
Available online 23 December 1999.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
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.
Author Keywords: Interconnection networks; Honeycomb torus; Hamiltonian cycle; Graph embedding






E-mail Article
Add to my Quick Links

Cited By in Scopus (14)






