版本更新 · v2arXiv:2508.17349
2-Layer Fan-Planarity in Polynomial Time
Yasuaki Kobayashi, Yuto Okada
原文摘要
In this paper, we give a polynomial-time algorithm for deciding whether a bipartite graph admits a 2-layer fan-planar drawing. This resolves an open problem posed in several papers since 2015. We also obtain a linear-time algorithm for the one-sided case.
cs.CG · cs.DS