Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters

Jelínek, Vít and Jelínková, Eva and Kratochvíl, Jan and Lidický, Bernard (2009) Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters. In: Graph Drawing 16th International Symposium, GD 2008, September 21- 24, 2008 , pp. 121-132(Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_13).

Full text not available from this repository.

Abstract

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.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-642-00219-9_13
Classifications: G Algorithms and Complexity > G.350 Clusters
G Algorithms and Complexity > G.770 Planarity Testing
URI: http://gdea.informatik.uni-koeln.de/id/eprint/902

Actions (login required)

View Item View Item