Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
arXiv:1408.2595
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.
Accepted at GD '14