Upper and Lower Bounds on the Pagenumber of the Book Embedding of the k-ary Hypercube
Date
2009
Authors
Bettayeb, Said
Journal Title
Journal ISSN
Volume Title
Publisher
Journal of Digital Information Management
Abstract
Graph embeddings play an important role in interconnection network and VLSI design. Determining the number of layers required to build a VLSI chip is just one of the many areas in which graph embeddings are used. A type of embedding that is helpful in determining the number of layers is a book embedding. We develop upper and lower bounds on the pagenumber of a book embedding of the k-ary hypercube along with an upper bound on the cumulative pagewidth.
Description
Keywords
Embedded Systems--Usage Very Large Scale Integration--Design and Construction
Citation
Upper and Lower Bounds on the Pagenumber of the Book Embedding of the k-ary hypercube, (with David Hoelzeman), Journal of Digital Information Management, Vol. 7 Issue 1, Feb. 2009, pp. 31-35.