Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
Markus Chimani, Giuseppe Di Battista, Fabrizio Frati, Karsten Klein
TL;DR
This paper presents a polynomial-time algorithm for testing c-planarity in a specific class of embedded flat clustered graphs with limited cluster vertices per face.
Contribution
It introduces a new efficient algorithm for c-planarity testing applicable to embedded flat clustered graphs with at most two vertices per cluster on each face.
Findings
Polynomial-time c-planarity testing algorithm developed
Applicable to embedded flat clustered graphs with limited cluster vertices
Advances understanding of c-planarity in constrained graph classes
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Optimization and Search Problems · Advanced Graph Theory Research