Advancements on SEFE and Partitioned Book Embedding problems

• Published in: Theoretical computer science Vol. 575; pp. 71 - 89
• Main Authors: Angelini, Patrizio, Da Lozzo, Giordano, Neuwirth, Daniel
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 13.04.2015
• Subjects: Combinatorial analysis; Computational complexity; Equivalence; Graph Drawing; Graph theory; Graphs; Intersections; Leaves; Max SEFE; Optimization; Partitioned Book Embedding; Sunflower SEFE; Trees; Partitioned Book Embedding; Graph Drawing; Sunflower SEFE; Max SEFE; Computational complexity

In this work we investigate the complexity of some combinatorial problems related to the Simultaneous Embedding with Fixed Edges (SEFE) and the Partitioned T-Coherentk-Page Book Embedding (PTBE-k) problems, which are known to be equivalent under certain conditions. Given k planar graphs on the same...