Cart (Loading....) | Create Account
Close category search window
 

An Algorithm to Embed Hamiltonian Cycles in Crossed Cubes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Dajin Wang ; Dept. of Comput. Sci., Montclair State Univ., Upper Montclair, NJ

In this paper, we study the problem of embedding a family of regularly-structured Hamiltonian cycles in a crosses cube. Since the crossed cube shows performance improvement over a regular hypercube in many aspects, we are interested in knowing whether it has the comparable capability in terms of structure embedding - specifically in this paper, the embedding of Hamiltonian cycles. It needs to be pointed out that we are only considering a family of Hamiltonian cycles that can be systematically constructed, characterized by the permutation of link dimensions (link permutation for short). The total number h(n) of Hamiltonian cycles in a regular n-dimensional hypercube happens to be huge, and many of them cannot be constructed in a systematic way. The exact h(n) has not been established for large n. The main work of this paper is that for those Hamiltonian facilitating permutations, we propose an algorithm that works out a well-structured Hamiltonian cycle

Published in:

Parallel Computing in Electrical Engineering, 2006. PAR ELEC 2006. International Symposium on

Date of Conference:

13-17 Sept. 2006

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.