Clustered Planarity with Pipes
Clustered Planarity with Pipes
复制标题
管道的簇平面度
作者：
Patrizio Angelini;Giordano Da Lozzo
我们研究了C-平面性问题的一个版本，其中连接同一对簇的边必须被分组到管道中，从而推广了带状平面性问题。我们给出了算法来决定两个变种的几类实例，其中每个集群周围管道的顺序是作为输入的一部分，或者可以由算法选择。
We study the version of the C-Planarity problem in which edges connecting the same pair of clusters must be grouped into pipes, which generalizes the Strip Planarity problem. We give algorithms to decide several families of instances for the two variants in which the order of the pipes around each cluster is given as part of the input or can be chosen by the algorithm.