Book embedding of the k-ary hypercube
Computer & Information Science
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. ©2008 IEEE.
1st International Conference on the Applications of Digital Information and Web Technologies, ICADIWT 2008
Bettayeb, S., & Hoelzeman, D. (2008). Book embedding of the k-ary hypercube. 2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT). https://doi.org/10.1109/icadiwt.2008.4664384