2-Layer Fan-Planarity in Polynomial Time
Yasuaki Kobayashi, Yuto Okada
TL;DR
This paper presents a polynomial-time algorithm to determine if a bipartite graph can be drawn in a 2-layer fan-planar manner, solving an open problem in graph drawing research since 2015.
Contribution
It introduces the first efficient algorithm for recognizing 2-layer fan-planar graphs, advancing understanding of graph planarity constraints.
Findings
Polynomial-time algorithm for 2-layer fan-planarity
Resolution of an open problem from 2015
Enhanced understanding of bipartite graph drawings
Abstract
In this paper, we give a polynomial-time algorithm for deciding whether an input bipartite graph admits a 2-layer fan-planar drawing, resolving an open problem posed in several papers since 2015.
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.