The Price of Upwardness
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_ | 1866915450865057792 |
|---|---|
| author | Angelini, Patrizio Biedl, Therese Chimani, Markus Cornelsen, Sabine Da Lozzo, Giordano Hong, Seok-Hee Liotta, Giuseppe Patrignani, Maurizio Pupyrev, Sergey Rutter, Ignaz Wolff, Alexander |
| author_facet | Angelini, Patrizio Biedl, Therese Chimani, Markus Cornelsen, Sabine Da Lozzo, Giordano Hong, Seok-Hee Liotta, Giuseppe Patrignani, Maurizio Pupyrev, Sergey Rutter, Ignaz Wolff, Alexander |
| contents | Not every directed acyclic graph (DAG) whose underlying undirected graph is planar admits an upward planar drawing. We are interested in pushing the notion of upward drawings beyond planarity by considering upward $k$-planar drawings of DAGs in which the edges are monotonically increasing in a common direction and every edge is crossed at most $k$ times for some integer $k \ge 1$. We show that the number of crossings per edge in a monotone drawing is in general unbounded for the class of bipartite outerplanar, cubic, or bounded pathwidth DAGs. However, it is at most two for outerpaths and it is at most quadratic in the bandwidth in general. From the computational point of view, we prove that testing upward-$k$-planarity is NP-complete already for $k=1$ and even for restricted instances for which upward planarity testing is polynomial. On the positive side, we can decide in linear time whether a single-source DAG admits an upward 1-planar drawing in which all vertices are incident to the outer face. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_01475 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The Price of Upwardness Angelini, Patrizio Biedl, Therese Chimani, Markus Cornelsen, Sabine Da Lozzo, Giordano Hong, Seok-Hee Liotta, Giuseppe Patrignani, Maurizio Pupyrev, Sergey Rutter, Ignaz Wolff, Alexander Computational Geometry Discrete Mathematics Not every directed acyclic graph (DAG) whose underlying undirected graph is planar admits an upward planar drawing. We are interested in pushing the notion of upward drawings beyond planarity by considering upward $k$-planar drawings of DAGs in which the edges are monotonically increasing in a common direction and every edge is crossed at most $k$ times for some integer $k \ge 1$. We show that the number of crossings per edge in a monotone drawing is in general unbounded for the class of bipartite outerplanar, cubic, or bounded pathwidth DAGs. However, it is at most two for outerpaths and it is at most quadratic in the bandwidth in general. From the computational point of view, we prove that testing upward-$k$-planarity is NP-complete already for $k=1$ and even for restricted instances for which upward planarity testing is polynomial. On the positive side, we can decide in linear time whether a single-source DAG admits an upward 1-planar drawing in which all vertices are incident to the outer face. |
| title | The Price of Upwardness |
| topic | Computational Geometry Discrete Mathematics |
| url | https://arxiv.org/abs/2409.01475 |