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    
advertisementadvertisement
Information Processing Letters
Volume 104, Issue 2, 16 October 2007, Pages 41-44
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (148 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.ipl.2007.05.006    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2007 Elsevier B.V. All rights reserved.

An improved upper bound on the queuenumber of the hypercube

Toru HasunumaCorresponding Author Contact Information, a, E-mail The Corresponding Author and Misa Hirotaa

aDepartment of Mathematical and Natural Sciences, The University of Tokushima, 1-1 Minamijosanjima, Tokushima 770-8502, Japan

Received 28 March 2007; 
revised 1 May 2007. 
Communicated by L. Boasson. 
Available online 18 May 2007.

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

In this note, we show that the n-dimensional hypercube Q(n) can be laid out using n−2 queues for all ngreater-or-equal, slanted5. Our result improves the previously known result for the case ngreater-or-equal, slanted5.

Keywords: Combinatorial problems; Queue layout; Hypercube; Interconnection networks


 
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.