A book embedding of a graph consists of an embedding of its nodes along the spine of a book (i.e., a linear ordering of the nodes), and an embedding of its edges on the pages so that edges embedded on the same page do not intersect. The objective is to minimize the number of pages used. The minimum number of pages in which a graph can be embedded is called the pagenumber of the graph. The book embedding problem arises in connection with an approach to faulttolerant VLSI design [R, CLRl, CLR2… CONTINUE READING