License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ISAAC.2016.13
URN: urn:nbn:de:0030-drops-67817
URL: http://drops.dagstuhl.de/opus/volltexte/2016/6781/
Go to the corresponding LIPIcs Volume Portal


Angelini, Patrizio ; Da Lozzo, Giordano

Clustered Planarity with Pipes

pdf-format:
LIPIcs-ISAAC-2016-13.pdf (0.7 MB)


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.

BibTeX - Entry

@InProceedings{angelini_et_al:LIPIcs:2016:6781,
  author =	{Patrizio Angelini and Giordano Da Lozzo},
  title =	{{Clustered Planarity with Pipes}},
  booktitle =	{27th International Symposium on Algorithms and Computation (ISAAC 2016)},
  pages =	{13:1--13:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-026-2},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{64},
  editor =	{Seok-Hee Hong},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6781},
  URN =		{urn:nbn:de:0030-drops-67817},
  doi =		{10.4230/LIPIcs.ISAAC.2016.13},
  annote =	{Keywords: Clustered Planarity, FPT, SEFE, Graph Drawing}
}

Keywords: Clustered Planarity, FPT, SEFE, Graph Drawing
Seminar: 27th International Symposium on Algorithms and Computation (ISAAC 2016)
Issue Date: 2016
Date of publication: 02.12.2016


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI