2016/09/15 by Jan Christoph Athenstädt, Sabine Cornelsen, Athenstädt, Jan Christoph +1
Computer Science · #Computational Geometry (cs.CG) #FOS: Computer and information sciences #G.2.2 #cs.CG
paper · pdf · doi:10.48550/arxiv.1609.04606
arxiv created 2016/09/15 · arxiv updated 2016/09/16
We show that clustered planarity with overlapping clusters as introduced by Didimo et al. can be solved in polynomial time if each cluster induces a connected subgraph. It can be solved in linear time if the set of clusters is the union of two partitions of the vertex set such that, for each cluster, both the cluster and its complement, induce connected subgraphs. Clustered planarity with overlapping clusters is NP-complete, even if restricted to instances where the underlying graph is 2-connected, the set of clusters is the union of two partitions and each cluster contains at most two connected components while their complements contain at most three connected components.