Simultaneous Orthogonal Planarity

We introduce and study the \({\textsc {OrthoSEFE}\text {-}{k}} \) problem: Given k planar graphs each with maximum degree 4 and the same vertex set, do they admit an OrthoSEFE, that is, is there an assignment of the vertices to grid points and of the edges to paths on the grid such that the same edges in distinct graphs are assigned the same path and such that the assignment induces a planar orthogonal drawing of each of the k graphs? We show that the problem is NP-complete for \(k \ge 3\) even if the shared graph is a Hamiltonian cycle and has sunflower intersection and for \(k \ge 2\) even if the shared graph consists of a cycle and of isolated vertices. Whereas the problem is polynomial-time solvable for \(k=2\) when the union graph has maximum degree five and the shared graph is biconnected. Further, when the shared graph is biconnected and has sunflower intersection, we show that every positive instance has an OrthoSEFE with at most three bends per edge.

[1]  Ulrik Brandes.  Eager st-Ordering , 2002, ESA.

[2]  Roberto Tamassia,et al.  On-Line Planarity Testing , 1989, SIAM J. Comput..

[3]  Michael A. Bekos,et al.  Geometric RAC Simultaneous Drawings of Graphs , 2012, J. Graph Algorithms Appl..

[4]  Roberto Tamassia,et al.  On Embedding a Graph in the Grid with the Minimum Number of Bends , 1987, SIAM J. Comput..

[5]  Goos Kant,et al.  A Better Heuristic for Orthogonal Graph Drawings , 1994, ESA.

[6]  Petra Mutzel,et al.  A Linear Time Implementation of SPQR-Trees , 2000, GD.

[7]  Wei-Kuan Shih,et al.  Unifying Maximum Cut and Minimum Cut of a Planar Graph , 1990, IEEE Trans. Computers.

[8]  Ignaz Rutter,et al.  Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices , 2017, Algorithmica.

[9]  Bernard M. E. Moret.  Theory of computation , 1978, Inf. Process. Manag..

[10]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[11]  Anna Lubiw,et al.  Simultaneous Interval Graphs , 2010, ISAAC.

[12]  Giordano Da Lozzo,et al.  Advancements on SEFE and Partitioned Book Embedding problems , 2013, Theor. Comput. Sci..

[13]  B. Moret,et al.  Planar NAE3SAT is in P , 1988, SIGA.

[14]  Stephen G. Kobourov,et al.  Simultaneous Embedding of Planar Graphs , 2012, Handbook of Graph Drawing and Visualization.

[15]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[16]  Michael Jünger,et al.  Simultaneous Geometric Graph Embeddings , 2007, GD.

[17]  Roberto Tamassia,et al.  On-Line Graph Algorithms with SPQR-Trees , 1990, ICALP.

[18]  Ignaz Rutter,et al.  Beyond Level Planarity , 2016, Graph Drawing.

[19]  Ignaz Rutter,et al.  Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems , 2013, SODA.

[20]  Roberto Tamassia,et al.  On-line maintenance of triconnected components with SPQR-trees , 1996, Algorithmica.

[21]  Michael Jünger,et al.  Intersection Graphs in Simultaneous Embedding with Fixed Edges , 2009, J. Graph Algorithms Appl..

[22]  Bernhard Haeupler,et al.  Testing Simultaneous Planarity when the Common Graph is 2-Connected , 2010, J. Graph Algorithms Appl..

[23]  Ignaz Rutter,et al.  Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph , 2012, J. Discrete Algorithms.

[24]  Alexander Wolff,et al.  Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends , 2015, WALCOM.

[25]  Ignaz Rutter,et al.  Disconnectivity and Relative Positions in Simultaneous Embeddings , 2012, Graph Drawing.

[26]  Anna Lubiw,et al.  The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs , 2012, J. Graph Algorithms Appl..

[27]  Marcus Schaefer,et al.  Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants , 2012, J. Graph Algorithms Appl..