Level Planarity Is More Difficult Than We Thought
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866909303306190848 |
|---|---|
| author | Fink, Simon D. Pfretzschner, Matthias Rutter, Ignaz Stumpf, Peter |
| author_facet | Fink, Simon D. Pfretzschner, Matthias Rutter, Ignaz Stumpf, Peter |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_01727 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Level Planarity Is More Difficult Than We Thought Fink, Simon D. Pfretzschner, Matthias Rutter, Ignaz Stumpf, Peter Discrete Mathematics 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. |
| title | Level Planarity Is More Difficult Than We Thought |
| topic | Discrete Mathematics |
| url | https://arxiv.org/abs/2409.01727 |