Upward Partitioned Book Embeddings

We analyze a directed variation of the book embedding problem when the page partition is prespecified and the nodes on the spine must be in topological order (upward book embedding). Given a directed acyclic graph and a partition of its edges into k pages, can we linearly order the vertices such tha...

Full description

Bibliographic Details
Main Authors: Akitaya, Hugo A., Demaine, Erik D, Hesterberg, Adam Classen, Liu, Quanquan C.
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Format: Book
Language:English
Published: Springer International Publishing 2020
Online Access:https://hdl.handle.net/1721.1/128437

Similar Items