Advances on Testing C-Planarity of Embedded Flat Clustered Graphs

Markus Chimani; Giuseppe Di Battista; Fabrizio Frati; Karsten Klein

Advances on Testing C-Planarity of Embedded Flat Clustered Graphs

Data Structures and Algorithms 2014-08-13 v1 Computational Geometry Discrete Mathematics

Authors: Markus Chimani , Giuseppe Di Battista , Fabrizio Frati , Karsten Klein

Abstract

We show a polynomial-time algorithm for testing c-planarity of embedded flat clustered graphs with at most two vertices per cluster on each face.

Keywords

planar graph drawing computational geometry computational complexity

Cite

@article{arxiv.1408.2595,
  title  = {Advances on Testing C-Planarity of Embedded Flat Clustered Graphs},
  author = {Markus Chimani and Giuseppe Di Battista and Fabrizio Frati and Karsten Klein},
  journal= {arXiv preprint arXiv:1408.2595},
  year   = {2014}
}