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 55, Issue 1, 7 July 1995, Pages 49-52
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (248 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/0020-0190(95)00054-G    How to Cite or Link Using DOI (Opens New Window)
Copyright © 1995 Published by Elsevier Science B.V.

On the generalized twisted cube

Fouad B. ChedidE-mail The Corresponding Author

Faculty of Computer Science, Temple University Japan, 2-2 Minami-Osawa, Hachioji-shi, Tokyo 192-03, Japan

Received 1 December 1995. 
Communicated by S.C. Akl 
Available online 5 April 2000.

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 generalized twisted cube GQn, a variation on hypercubes (Qn) with smaller diameter, was introduced in [1]. In [1], we claimed that the complete binary tree on 2n − 1 nodes (Tn), which is not a subgraph of the Qn, is a subgraph of the GQn. The proof which appeared in [1] is incorrect. This note is intended to (1) support that claim and (2) present an efficient dilation 1 embedding of the N × N mesh of trees, a very powerful network for parallel computation, in the 4N2 — node GQ.

Author Keywords: Parallel processing; Hypercubes; Meshes of trees

Article Outline

• References

 
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.