In this paper we introduce a generalization of the c-planarity testing problem for clustered graphs. Namely, given a clustered graph, the goal of the Split-C-Planarity problem is to split as few clusters as possible in order to make the graph c-planar. Determining whether zero splits are enough coincides with testing c-planarity. We show that Split-C-Planarity is NP-complete for c-connected clustered triangulations and for non-c-connected clustered paths and cycles. On the other hand, we present a polynomial-time algorithm for flat c-connected clustered graphs whose underlying graph is a biconnected series-parallel graph, both in the fixed and in the variable embedding setting, when the splits are assumed to maintain the c-connectivity of the clusters. © 2010 Springer-Verlag.
CITATION STYLE
Angelini, P., Frati, F., & Patrignani, M. (2010). Splitting clusters to get C-planarity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5849 LNCS, pp. 57–68). https://doi.org/10.1007/978-3-642-11805-0_8
Mendeley helps you to discover research relevant for your work.