Establishing order in planar subdivisions
Discrete & Computational Geometry - ACM Symposium on Computational Geometry, Waterloo
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
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
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
Clustered Planarity: Clusters with Few Outgoing Edges
Graph Drawing
Computing Maximum C-Planar Subgraphs
Graph Drawing
Splitting clusters to get c-planarity
GD'09 Proceedings of the 17th international conference on Graph Drawing
| Hi-index | 0.00 |
Let C be a clustered graph and suppose that the planar embedding of its underlying graph is fixed. Is testing the c-planarity of C easier than in the variable embedding setting? In this paper we give a first contribution towards answering the above question. Namely, we characterize c-planar embedded flat clustered graphs with at most five vertices per face and give an efficient testing algorithm for such graphs. The results are based on a more general methodology that shades new light on the c-planarity testing problem.