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, Heraklion, Crete, Greece , pp. 121-132 (Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_13).
Full text not available from this repository.
We present a polynomial-time algorithm for c-planarity testing of clustered graphs with ﬁxed plane embedding and such that every cluster induces a subgraph with at most two connected components.
Repository Staff Only: item control page