2-Layer Fan-Planarity in Polynomial Time
Computational Geometry
2025-08-26 v1 Data Structures and Algorithms
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.
Cite
@article{arxiv.2508.17349,
title = {2-Layer Fan-Planarity in Polynomial Time},
author = {Yasuaki Kobayashi and Yuto Okada},
journal= {arXiv preprint arXiv:2508.17349},
year = {2025}
}
Comments
7 pages, 4 figures