Title
Upper and lower bounds on the pagenumber of the book embedding of the k-ary hypercube
Document Type
Article
Publication Date
2-1-2009
Department
Computer & Information Science
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.
First Page
30
Last Page
34
Publication Title
Journal of Digital Information Management
Recommended Citation
Bettayeb, S., & Hoelzeman, D. (2009). Upper and lower bounds on the pagenumber of the book embedding of the k-ary hypercube. Journal of Digital Information Management 7(1): 30-34.