Straight-Line Rectangular Drawings of Clustered Graphs

We show that every c-planar clustered graph has a straight-line c-planar drawing in which each cluster is represented by an axis-parallel rectangle, thus solving a problem posed by Eades, Feng, Lin, and Nagamochi (Algorithmica 44(1):1–32, 2006).

[1]  Hiroshi Nagamochi,et al.  Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs , 1996, Algorithmica.

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

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

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

[5]  Hiroshi Nagamochi,et al.  Drawing c-planar biconnected clustered graphs , 2007, Discret. Appl. Math..

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

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

[8]  Michael Kaufmann,et al.  Drawing graphs: methods and models , 2001 .

[9]  Giuseppe Di Battista,et al.  Clustering Cycles into Cycles of Clusters , 2005, J. Graph Algorithms Appl..

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

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

[12]  Roberto Tamassia,et al.  Algorithms for Plane Representations of Acyclic Digraphs , 1988, Theor. Comput. Sci..

[13]  Giuseppe Di Battista,et al.  Non-convex Representations of Graphs , 2008, Graph Drawing.

[14]  Ioannis G. Tollis,et al.  Graph Drawing , 1994, Lecture Notes in Computer Science.

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

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

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

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

[19]  Hiroshi Nagamochi,et al.  Drawing Clustered Graphs on an Orthogonal Grid , 1999, J. Graph Algorithms Appl..

[20]  Michael Kaufmann,et al.  Straight-Line Rectangular Drawings of Clustered Graphs , 2009, WADS.

[21]  Martin Pergel,et al.  Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs , 2009, J. Graph Algorithms Appl..

[22]  Giuseppe Di Battista,et al.  How to Draw a Clustered Tree , 2007, WADS.

[23]  In-kyeong Choi.  On straight line representations of random planar graphs , 1992 .