Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
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.
- 2.Cortese, P.F., Di Battista, G.: Clustered planarity. In: ACM SoCG 2005, pp. 32–34 (2005)Google Scholar
- 6.Di Battista, G., Frati, F.: Efficient c-planarity testing for embedded flat clustered graphs with small faces. Tech. Report RT-DIA-119-2007, Dip. Inf. e Aut., Univ. Roma Tre (2007)Google Scholar
- 7.Feng, Q., Cohen, R.F., Eades, P.: Planarity for clustered graphs. In: Spirakis, P.G. (ed.) ESA 1995. LNCS, vol. 979, pp. 213–226. Springer, Heidelberg (1995)Google Scholar
- 11.Nishizeki, T., Chiba, N.: Planar Graphs: Theory and Algorithms. North-Holland (1988)Google Scholar