Title

Book embedding of the k-ary hypercube

Document Type

Conference Proceeding

Publication Date

12-30-2008

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. ©2008 IEEE.

DOI

10.1109/ICADIWT.2008.4664384

First Page

415

Last Page

421

Publication Title

1st International Conference on the Applications of Digital Information and Web Technologies, ICADIWT 2008

ISBN

9781424426249

This document is currently not available here.

Share

COinS