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

Abstract

We show a polynomial time algorithm for deciding if there is a cluster embedding for graphs with two components where all clusters have at most two components.

Keywords

• Clustered
• Planarity
• Embedded
• Clustered
• Graphs
• Two-Component
• Clusters
• Extended
• Abstract