Advances in C-Planarity Testing of Clustered Graphs

Gutwenger, Carsten and Jünger, Michael and Leipert, Sebastian and Mutzel, Petra and Percan, Merijam and Weiskircher, René (2002) Advances in C-Planarity Testing of Clustered Graphs. [Preprint]

WarningThere is a more recent version of this item available.
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (242kB) | Preview


A clustered graph C=(G,T) consists of an undirected graph G and a rooted tree T in which the leaves of T correspond to the vertices of G=(V,E). Each vertex c in T corresponds to a subset of the vertices of the graph called ''cluster''. C-planarity is a natural extension of graph planarity for clustered graphs, and plays an important role in automatic graph drawing. The complexity status of c-planarity testing is unknown. It has been shown that c-planarity can be tested in linear time for c-connected graphs, i.e., graphs in which the cluster induced subgraphs are connected. In this paper, we provide a polynomial time algorithm for c-planarity testing for "almost" c-connected clustered graphs, i.e., graphs for which all c-vertices corresponding to the non-c-connected clusters lie on the same path in T starting at the root of T, or graphs in which for each non-connected cluster its super-cluster and all its siblings are connected. The algorithm uses ideas of the algorithm for subgraph induced planar connectivity augmentation. We regard it as a first step towards general c-planarity testing.

Item Type: Preprint
Classifications: P Styles > P.180 Cluster
G Algorithms and Complexity > G.770 Planarity Testing
P Styles > P.540 Planar

Available Versions of this Item

Actions (login required)

View Item View Item