Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
Giuseppe Di Battista, Fabrizio Frati · Journal of Graph Algorithms and Applications · 2009
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 sheds new light on the c-planarity testing problem.