Upward Partitioned Book Embeddings
Name
1708.06730.pdf
Description
Submitted version
Size
482.53 KB
Format
Adobe PDF
Checksum (MD5)
590b99198024ec3202a7107a8d599bfd
Author(s)
Akitaya, Hugo A.
Demaine, Erik D
Hesterberg, Adam Classen
Liu, Quanquan C.
Date Issued
January 2018
Journal
International Symposium on Graph Drawing and Network Visualization
Publisher
Springer International Publishing
Citation
Akitaya, Hugo A. et al. "Upward Partitioned Book Embeddings." International Symposium on Graph Drawing and Network Visualization, September 2018, Barcelona, Spain, Springer International Publishing, January 2018. © 2018 Springer International Publishing AG
Version
Original manuscript
Abstract
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 that the drawing is upward (a topological sort) and each page avoids crossings? We prove that the problem is NP-complete for K ≥ 3, and for K ≥ 4 even in the special case when each page is a matching. By contrast, the problem can be solved in linear time for k = 2 pages when pages are restricted to matchings. The problem comes from Jack Edmonds (1997), motivated as a generalization of the map folding problem from computational origami.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-319-73915-1_18
