By Topic

The linear layout of the incomplete hypercube

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

3 Author(s)
Jywe-Fei Fang ; Dept. of Digital Content & Technol., Nat. Taichung Univ. ; Kuan-Chou Lai ; Ching-Chi Kao

In this paper, we study the linear layout problem of an incomplete hypercube by the embedding-in-book technique. An incomplete hypercube is a generalization of the hypercube in the sense that the number of nodes can be an arbitrary number. Embedding a graph in a book is to place nodes on the spine of a book and to draw the edges such that edges residing in a page do not cross. In this paper, we propose a scheme to embed an incomplete hypercube of 2n + 2m nodes, where n > m ges 0, with n - 1 pages, cumulative page width 2n + 2m - 3; and book width 2n - 1 + 2m - 1 for n > m > 0, 2n-1 for n > m = 0. Moreover, this scheme can be applied to an arbitrary size of an incomplete hypercube

Published in:

High-Performance Computing in Asia-Pacific Region, 2005. Proceedings. Eighth International Conference on

Date of Conference:

1-1 July 2005