文章基本信息

标题：Clustered Planarity with Pipes
本地全文：下载
作者：Patrizio Angelini ; Giordano Da Lozzo
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2016
卷号：64
页码：13:1-13:13
DOI：10.4230/LIPIcs.ISAAC.2016.13
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：Clustered Planarity; FPT; SEFE; Graph Drawing