论文信息 - Straight-Line Rectangular Drawings of Clustered Graphs - 字舞流文

Straight-Line Rectangular Drawings of Clustered Graphs

We show that every c -planar clustered graph admits 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, 2006 ].

Michael Kaufmann | Fabrizio Frati | Patrizio Angelini

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

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

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

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

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

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

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

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

[9] Xuemin Lin,et al. Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs , 1996, Graph Drawing.

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

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

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

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