Lecture Notes in Computer Science, 2009, Volume 5417/2009, 121-132, DOI: 10.1007/978-3-642-00219-9_13

Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
(Extended Abstract)

Vít Jelínek, Eva Jelínková, Jan Kratochvíl and Bernard Lidický

View Related Documents

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.

Fulltext Preview

Image of the first page of the fulltext document