arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1609.04606cs.CG
收藏

包含两个分拆并的重叠列的C-平面性

C-Planarity of Overlapping Clusterings Including Unions of Two Partitions

Jan Christoph Athenstädt, Sabine Cornelsen

摘要:

我们表明,集群平面性与重叠集群Didimo等人。可以解决在多项式时间,如果每个集群导致一个连通子图。它可以在线性时间内解决,如果集群的集合是顶点集的两个分区的并集,使得对于每个集群,集群和它的补充,诱导连通子图。具有重叠簇的扩展平面性是NP完全的,即使仅限于底层图是2-连通的情况,簇的集合是两个分区的并集,并且每个簇最多包含两个连通分量,而它们的补簇最多包含三个连通分量。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑