Part of the Lecture Notes in Computer Science book series (LNCS, volume 5417)
Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
We present a polynomial-time algorithm for c-planarity testing of clustered graphs with fixed plane embedding and such that every cluster induces a subgraph with at most two connected components.
KeywordsConnected Subgraph Outer Face Root Cluster Underlying Graph Pruning Rule
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
- 2.Cortese, P.F., Di Battista, G., Patrignani, M., Pizzonia, M.: Clustering cycles into cycles of clusters. Journal of Graph Algorithms and Applications 9(3), 391–413 (2005); special issue In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 100–110. Springer, Heidelberg (2005)CrossRefzbMATHMathSciNetGoogle Scholar
© Springer-Verlag Berlin Heidelberg 2009