Level Planarity Is More Difficult Than We Thought
Discrete Mathematics
2024-09-04 v1
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.
Keywords
Cite
@article{arxiv.2409.01727,
title = {Level Planarity Is More Difficult Than We Thought},
author = {Simon D. Fink and Matthias Pfretzschner and Ignaz Rutter and Peter Stumpf},
journal= {arXiv preprint arXiv:2409.01727},
year = {2024}
}
Comments
Poster presented at GD 2024