Level Planarity Is More Difficult Than We Thought

2024/09/03 by Fink, Simon D., Pfretzschner, Matthias, Rutter, Ignaz +1 · 1 citation
#Discrete Mathematics (cs.DM) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.2409.01727

Abstract

We consider three simple quadratic time algorithms for the problem Level Planarity and give a level-planar instance that they either falsely report as negative or for which they output a drawing that is not level planar.

Cited by

• Drawing Reeb Graphs

Related

• Level Planarity: Transitivity vs. Even Crossings
• On the Complexity of Clustered-Level Planarity and T-Level Planarity
• Multilevel Planarity
• Beyond Level Planarity
• Level-Planar Drawings with Few Slopes