Clustered Planarity with Pipes
Data Structures and Algorithms
2016-10-03 v1
Abstract
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.
Cite
@article{arxiv.1609.09679,
title = {Clustered Planarity with Pipes},
author = {Patrizio Angelini and Giordano Da Lozzo},
journal= {arXiv preprint arXiv:1609.09679},
year = {2016}
}
Comments
19 pages, 9 figures, extended version of the paper appeared at ISAAC 2016