ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Information Processing Letters
Volume 72, Issues 3-4, 26 November 1999, Pages 99-103
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (107 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0020-0190(99)00141-6    How to Cite or Link Using DOI (Opens New Window)
Copyright © 1999 Published by Elsevier Science B.V. All rights reserved.

Honeycomb tori are Hamiltonian*1

G. M. MegsonCorresponding Author Contact Information, E-mail The Corresponding Author, a, Xiaofan YangE-mail The Corresponding Author, b and Xiaoping Liuc

a Department of Computer Science, University of Reading, P.O. Box 225, Whiteknights, Reading, Berkshire RG6 6AY, UK b School of Computer Science, Chongqing University, Chongqing, 430044, People's Republic of China c Institute of Multimedia Network and Telecommunication Engineering, Wuhan Technological University of Surveying and Mapping, Wuhan, 430079, Hubei, People's Republic of China

Received 22 January 1999;
revised 5 October 1999.
Communicated by C. Morgan
Available online 23 December 1999.

Purchase the full-text article



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


 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.