Zobrazeno 1 - 10
of 879
pro vyhledávání: '"Battista, Giuseppe"'
Let $\mathcal{G}$ be the set of all the planar embeddings of a (not necessarily connected) $n$-vertex graph $G$. We present a bijection $\Phi$ from $\mathcal{G}$ to the natural numbers in the interval $[0 \dots |\mathcal{G}| - 1]$. Given a planar emb
Externí odkaz:
http://arxiv.org/abs/2411.10319
We present singly-exponential quantum algorithms for the One-Sided Crossing Minimization (OSCM) problem. Given an $n$-vertex bipartite graph $G=(U,V,E\subseteq U \times V)$, a $2$-level drawing $(\pi_U,\pi_V)$ of $G$ is described by a linear ordering
Externí odkaz:
http://arxiv.org/abs/2409.01942
Autor:
Alegria, Carlos, Caroppo, Susanna, Da Lozzo, Giordano, D'Elia, Marco, Di Battista, Giuseppe, Frati, Fabrizio, Grosso, Fabrizio, Patrignani, Maurizio
We study upward pointset embeddings (UPSEs) of planar $st$-graphs. Let $G$ be a planar $st$-graph and let $S \subset \mathbb{R}^2$ be a pointset with $|S|= |V(G)|$. An UPSE of $G$ on $S$ is an upward planar straight-line drawing of $G$ that maps the
Externí odkaz:
http://arxiv.org/abs/2408.17369
Autor:
Da Lozzo, Giordano, Di Battista, Giuseppe, Frati, Fabrizio, Grosso, Fabrizio, Patrignani, Maurizio
We propose efficient algorithms for enumerating the notorious combinatorial structures of maximal planar graphs, called canonical orderings and Schnyder woods, and the related classical graph drawings by de Fraysseix, Pach, and Pollack [Combinatorica
Externí odkaz:
http://arxiv.org/abs/2310.02247
Autor:
Binucci, Carla, Büngener, Aaron, Di Battista, Giuseppe, Didimo, Walter, Dujmović, Vida, Hong, Seok-Hee, Kaufmann, Michael, Liotta, Giuseppe, Morin, Pat, Tappini, Alessandra
The study of nonplanar drawings of graphs with restricted crossing configurations is a well-established topic in graph drawing, often referred to as beyond-planar graph drawing. One of the most studied types of drawings in this area are the $k$-plana
Externí odkaz:
http://arxiv.org/abs/2308.13401
Many data sets, crucial for today's applications, consist essentially of enormous networks, containing millions or even billions of elements. Having the possibility of visualizing such networks is of paramount importance. We propose an algorithmic fr
Externí odkaz:
http://arxiv.org/abs/2307.12393
In this paper, we initiate the study of quantum algorithms in the Graph Drawing research area. We focus on two foundational drawing standards: 2-level drawings and book layouts. Concerning $2$-level drawings, we consider the problems of obtaining dra
Externí odkaz:
http://arxiv.org/abs/2307.08371
Autor:
Ahmed, Reyan, Angelini, Patrizio, Bekos, Michael A., Di Battista, Giuseppe, Kaufmann, Michael, Kindermann, Philipp, Kobourov, Stephen, Nöllenburg, Martin, Symvonis, Antonios, Villedieu, Anaïs, Wallinger, Markus
Bipartite graphs model the relationships between two disjoint sets of entities in several applications and are naturally drawn as 2-layer graph drawings. In such drawings, the two sets of entities (vertices) are placed on two parallel lines (layers),
Externí odkaz:
http://arxiv.org/abs/2301.10872
Autor:
Alegria, Carlos, Da Lozzo, Giordano, Di Battista, Giuseppe, Frati, Fabrizio, Grosso, Fabrizio, Patrignani, Maurizio
A rectangular drawing of a planar graph $G$ is a planar drawing of $G$ in which vertices are mapped to grid points, edges are mapped to horizontal and vertical straight-line segments, and faces are drawn as rectangles. Sometimes this latter constrain
Externí odkaz:
http://arxiv.org/abs/2208.14142
Autor:
Di Battista, Giuseppe, Didimo, Walter, Grilli, Luca, Grosso, Fabrizio, Ortali, Giacomo, Patrignani, Maurizio, Tappini, Alessandra
In a graph story the vertices enter a graph one at a time and each vertex persists in the graph for a fixed amount of time $\omega$, called viewing window. At any time, the user can see only the drawing of the graph induced by the vertices in the vie
Externí odkaz:
http://arxiv.org/abs/2208.14126