Zobrazeno 1 - 10
of 25 761
pro vyhledávání: '"Rutter A"'
In the Partially Embedded Planarity problem, we are given a graph $G$ together with a topological drawing of a subgraph $H$ of $G$. The task is to decide whether the drawing can be extended to a drawing of the whole graph such that no two edges cross
Externí odkaz:
http://arxiv.org/abs/2410.13536
Autor:
Da Lozzo, Giordano, Didimo, Walter, Montecchiani, Fabrizio, Münch, Miriam, Patrignani, Maurizio, Rutter, Ignaz
An abstract topological graph (AT-graph) is a pair $A=(G,\mathcal{X})$, where $G=(V,E)$ is a graph and $\mathcal{X} \subseteq {E \choose 2}$ is a set of pairs of edges of $G$. A realization of $A$ is a drawing $\Gamma_A$ of $G$ in the plane such that
Externí odkaz:
http://arxiv.org/abs/2409.20108
Evolutionary algorithms (EAs) are universal solvers inspired by principles of natural evolution. In many applications, EAs produce astonishingly good solutions. As they are able to deal with complex optimisation problems, they show great promise for
Externí odkaz:
http://arxiv.org/abs/2409.15312
Autor:
Bekos, Michael, Da Lozzo, Giordano, Frati, Fabrizio, Gupta, Siddharth, Kindermann, Philipp, Liotta, Giuseppe, Rutter, Ignaz, Tollis, Ioannis G.
This paper studies planar drawings of graphs in which each vertex is represented as a point along a sequence of horizontal lines, called levels, and each edge is either a horizontal segment or a strictly $y$-monotone curve. A graph is $s$-span weakly
Externí odkaz:
http://arxiv.org/abs/2409.01889
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
Autor:
Angelini, Patrizio, Biedl, Therese, Chimani, Markus, Cornelsen, Sabine, Da Lozzo, Giordano, Hong, Seok-Hee, Liotta, Giuseppe, Patrignani, Maurizio, Pupyrev, Sergey, Rutter, Ignaz, Wolff, Alexander
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
Externí odkaz:
http://arxiv.org/abs/2409.01475
We introduce the $k$-Plane Insertion into Plane drawing ($k$-PIP) problem: given a plane drawing of a planar graph $G$ and a set $F$ of edges, insert the edges in $F$ into the drawing such that the resulting drawing is $k$-plane. In this paper, we sh
Externí odkaz:
http://arxiv.org/abs/2402.14552
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
Autor:
Fink, Simon D., Rutter, Ignaz
In the constrained planarity setting, we ask whether a graph admits a planar drawing that additionally satisfies a given set of constraints. These constraints are often derived from very natural problems; prominent examples are Level Planarity, where
Externí odkaz:
http://arxiv.org/abs/2310.20632
Given a graph $G$ with a fixed vertex order $\prec$, one obtains a circle graph $H$ whose vertices are the edges of $G$ and where two such edges are adjacent if and only if their endpoints are pairwise distinct and alternate in $\prec$. Therefore, th
Externí odkaz:
http://arxiv.org/abs/2309.02258