We study the VLSI-related problem of embedding graphs in books. A book embedding of a graph G =(V ,E) consists of two parts, namely, (1) an ordering of V along the spine of the book, and (2) an assignment of each eE E to a page of the book, so that edges assigned to the same page do not intersect. In devising an-embedding, one seeks to minimi;ze the number of pages used. This paper addresses a ...
