Level Planarity Is More Difficult Than We Thought

Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter +1

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 ou…