Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Pfretzschner, Matthias"'
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.
Comment: Poster presente
Comment: Poster presente
Externí odkaz:
http://arxiv.org/abs/2409.01727
We consider variants of the clustered planarity problem for level-planar drawings. So far, only convex clusters have been studied in this setting. We introduce two new variants that both insist on a level-planar drawing of the input graph but relax t
Externí odkaz:
http://arxiv.org/abs/2402.13153
Given $k$ input graphs $G_1, \dots ,G_k$, where each pair $G_i$, $G_j$ with $i \neq j$ shares the same graph $G$, the problem Simultaneous Embedding With Fixed Edges (SEFE) asks whether there exists a planar drawing for each input graph such that all
Externí odkaz:
http://arxiv.org/abs/2308.11401
Motivated by the planarization of 2-layered straight-line drawings, we consider the problem of modifying a graph such that the resulting graph has pathwidth at most 1. The problem Pathwidth-One Vertex Explosion (POVE) asks whether such a graph can be
Externí odkaz:
http://arxiv.org/abs/2302.14725
PQ-trees and PC-trees are data structures that represent sets of linear and circular orders, respectively, subject to constraints that specific subsets of elements have to be consecutive. While equivalent to each other, PC-trees are conceptually much
Externí odkaz:
http://arxiv.org/abs/2106.14805
Publikováno v:
Journal of Experimental Algorithmics (JEA); Dec2023, Vol. 28, p1-24, 24p