Recognition: unknown
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
classification
💻 cs.DS
cs.CGcs.DM
keywords
c-planarityclusteredembeddedflatgraphstestingadvancesalgorithm
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.