The Price of Upwardness

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 commo...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Discrete Mathematics and Theoretical Computer Science Ročník 27:3; číslo Graph Theory; s. 1 - 30
Hlavní autoři: Angelini, Patrizio, Biedl, Therese, Chimani, Markus, Cornelsen, Sabine, Da Lozzo, Giordano, Hong, Seok-Hee, Liotta, Giuseppe, Patrignani, Maurizio, Pupyrev, Sergey, Rutter, Ignaz, Wolff, Alexander
Médium: Journal Article
Jazyk:angličtina
Vydáno: Nancy DMTCS 01.10.2025
Discrete Mathematics & Theoretical Computer Science
Témata:
computational geometry
discrete mathematics
Graph representations
Graph theory
Mathematical research
Italy
ISSN:1365-8050, 1462-7264, 1365-8050
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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. This is the full version of a paper that appeared in the Proc. 32nd Int. Symp. Graph Drawing & Network Visualization (GD 2024)
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1365-8050
1462-7264
1365-8050
DOI:10.46298/dmtcs.15222