Graph Algorithms
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
How to Draw a Planar Clustered Graph
COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
Planarization of Clustered Graphs
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Advances in C-Planarity Testing of Clustered Graphs
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Drawing Planar Partitions II: HH-Drawings
WG '98 Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science
Planarity for Clustered Graphs
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Clustered Planarity: Clusters with Few Outgoing Edges
Graph Drawing
Computing Maximum C-Planar Subgraphs
Graph Drawing
On embedding a cycle in a plane graph
GD'05 Proceedings of the 13th international conference on Graph Drawing
C-planarity of extrovert clustered graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
| Hi-index | 0.00 |
In this paper we study the clustered graphs whose underlying graph is a cycle. This is a simple family of clustered graphs that are “highly non connected”. We start by studying 3-cluster cycles, that are clustered graphs such that the underlying graph is a simple cycle and there are three clusters all at the same level. We show that in this case testing the c-planarity can be done efficiently and give an efficient drawing algorithm. Also, we characterize 3-cluster cycles in terms of formal grammars. Finally, we generalize the results on 3-cluster cycles considering clustered graphs that at each level of the inclusion tree have a cycle structure. Even in this case we show efficient c-planarity testing and drawing algorithms.