2026-07-25T15:15:35Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6781 2024-03-06T10:38:52Z ddc:004 open_access

Clustered Planarity with Pipes Angelini, Patrizio Da Lozzo, Giordano Clustered Planarity FPT SEFE Graph Drawing 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Patrizio Angelini and Giordano Da Lozzo 2016 Is Part Of LIPIcs, Volume 64, 27th International Symposium on Algorithms and Computation (ISAAC 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ISAAC.2016.13 urn:nbn:de:0030-drops-67817 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.13 eng https://creativecommons.org/licenses/by/3.0/legalcode