Relaxing the constraints of clustered planarity

In a drawing of a clustered graph vertices and edges are drawn as points and curves, respectively, while clusters are represented by simple closed regions. A drawing of a clustered graph is c-planar if it has no edge-edge, edge-region, or region-region crossings. Determining the complexity of testing whether a clustered graph admits a c-planar drawing is a long-standing open problem in the Graph Drawing research area. An obvious necessary condition for c-planarity is the planarity of the graph underlying the clustered graph. However, this condition is not sufficient and the consequences on the problem due to the requirement of not having edge-region and region-region crossings are not yet fully understood.In order to shed light on the c-planarity problem, we consider a relaxed version of it, where some kinds of crossings (either edge-edge, edge-region, or region-region) are allowed even if the underlying graph is planar. We investigate the relationships among the minimum number of edge-edge, edge-region, and region-region crossings for drawings of the same clustered graph. Also, we consider drawings in which only crossings of one kind are admitted. In this setting, we prove that drawings with only edge-edge or with only edge-region crossings always exist, while drawings with only region-region crossings may not. Further, we provide upper and lower bounds for the number of such crossings. Finally, we give a polynomial-time algorithm to test whether a drawing with only region-region crossings exists for biconnected graphs, hence identifying a first non-trivial necessary condition for c-planarity that can be tested in polynomial time for a noticeable class of graphs.

[1]  Robert F. Cohen,et al.  How to Draw a Planar Clustered Graph , 1995, COCOON.

[2]  Giuseppe Di Battista,et al.  On embedding a cycle in a plane graph , 2009, Discret. Math..

[3]  Stephen G. Kobourov,et al.  Simultaneous Embedding of Planar Graphs with Few Bends , 2004, Graph Drawing.

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

[5]  Frank Kammer.  Simultaneous Embedding with Two Bends per Edge in Polynomial Area , 2006, SWAT.

[6]  Giuseppe Di Battista,et al.  C-Planarity of C-Connected Clustered Graphs , 2008, J. Graph Algorithms Appl..

[7]  Giuseppe Di Battista,et al.  Clustered Planarity (Invited Lecture) , 2005, SoCG 2005.

[8]  Robert F. Cohen,et al.  Planarity for Clustered Graphs , 1995, ESA.

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

[10]  Martin Pergel,et al.  Clustered Planarity: Small Clusters in Eulerian Graphs , 2007, Graph Drawing.

[11]  Elias Dahlhaus,et al.  A Linear Time Algorithm to Recognize Clustered Graphs and Its Parallelization , 1998, LATIN.

[12]  David S. Johnson,et al.  Crossing Number is NP-Complete , 1983 .

[13]  Dorothea Wagner,et al.  Completely connected clustered graphs , 2006, J. Discrete Algorithms.

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

[15]  Joseph S. B. Mitchell,et al.  On Simultaneous Planar Graph Embeddings , 2003, WADS.

[16]  David S. Johnson,et al.  The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.

[17]  Vít Jelínek,et al.  Clustered Planarity: Clusters with Few Outgoing Edges , 2008, Graph Drawing.

[18]  Jan Kratochvíl,et al.  Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters , 2008, Graph Drawing.

[19]  Giuseppe Di Battista,et al.  Clustered planarity , 2005, Symposium on Computational Geometry.

[20]  Walter Didimo,et al.  Planarization of Clustered Graphs , 2001, Graph Drawing.

[21]  Michael Jünger,et al.  Advances in C-Planarity Testing of Clustered Graphs , 2002, Graph Drawing.

[22]  Michael Forster,et al.  Crossings in clustered level graphs , 2005 .

[23]  Jj Anos Pach.  Which Crossing Number Is It Anyway? , 1998 .

[24]  Michael T. Goodrich,et al.  C-Planarity of Extrovert Clustered Graphs , 2005, Graph Drawing.

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

[26]  Fabrizio Frati,et al.  Splitting Clusters to Get C-Planarity , 2009, Graph Drawing.

[27]  Kellogg S. Booth,et al.  Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..