2-Layer Fan-Planarity in Polynomial Time
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909750991519744 |
|---|---|
| author | Kobayashi, Yasuaki Okada, Yuto |
| author_facet | Kobayashi, Yasuaki Okada, Yuto |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_17349 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | 2-Layer Fan-Planarity in Polynomial Time Kobayashi, Yasuaki Okada, Yuto Computational Geometry Data Structures and Algorithms 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. |
| title | 2-Layer Fan-Planarity in Polynomial Time |
| topic | Computational Geometry Data Structures and Algorithms |
| url | https://arxiv.org/abs/2508.17349 |