Advances on Testing C-Planarity of Embedded Flat Clustered Graphs

Markus Chimani, Giuseppe Di Battista, Fabrizio Frati +1

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.