Score: 0
2-Layer Fan-Planarity in Polynomial Time
Published: August 24, 2025 |
arXiv ID: 2508.17349v1
By: Yasuaki Kobayashi, Yuto Okada
Potential Business Impact:
Draws complex maps without lines crossing.
Business Areas:
A/B Testing
Data and Analytics
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.
Similar Papers
87%
Pathwidth of 2-Layer $k$-Planar Graphs
Discrete Mathematics
Draws graphs with fewer crossings, making them simpler.
29 Jul 2025
0
87%
Pathwidth of 2-Layer $k$-Planar Graphs
Discrete Mathematics
Makes drawings with few crossings have simple paths.
29 Jul 2025
0
85%
k-Planar and Fan-Crossing Drawings and Transductions of Planar Graphs
Computational Geometry
Draws complex graphs on flat surfaces.
10 Jun 2025
0
Country of Origin
🇯🇵
Japan
Page Count
7 pages
Category
Computer Science:
Computational Geometry