Journal of Graph Algorithms and Applications
|Home||Issues||About JGAA||Instructions for Authors|
Planarity of Overlapping Clusterings Including Unions of Two Partitions
Vol. 21, no. 6, pp. 1057-1089, 2017. Regular paper.
Abstract We consider clustered planarity with overlapping clusters as introduced by Didimo et al. (Didimo, Giordano, Liotta, JGAA, 2008). It can be deduced from a proof in Athenstädt et al. (J. C. Athenstädt, T. Hartmann, and M. Nöllenburg, GD 2014) that the problem 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. In this paper, we show that clustered planarity with overlapping clusters 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.
Submitted: March 2017.
Reviewed: September 2017.
Revised: September 2017.
Accepted: September 2017.
Final: October 2017.
Published: October 2017.
Communicated by Giuseppe Liotta