Papers
Topics
Authors
Recent
Search
2000 character limit reached

2-Layer Fan-Planarity in Polynomial Time

Published 24 Aug 2025 in cs.CG and cs.DS | (2508.17349v1)

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.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now