How to Draw a Planar Clustered Graph
COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs
GD '96 Proceedings of the Symposium on Graph Drawing
Advances in C-Planarity Testing of Clustered Graphs
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Planarity for Clustered Graphs
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
A Linear Time Algorithm to Recognize Clustered Graphs and Its Parallelization
LATIN '98 Proceedings of the Third Latin American Symposium on Theoretical Informatics
Drawing c-planar biconnected clustered graphs
Discrete Applied Mathematics
Clustered planarity: small clusters in Eulerian graphs
GD'07 Proceedings of the 15th international conference on Graph drawing
C-planarity of extrovert clustered graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Confluent drawing algorithms using rectangular dualization
GD'10 Proceedings of the 18th international conference on Graph drawing
| Hi-index | 0.00 |
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 ].