Zobrazeno 1 - 10
of 1 116
pro vyhledávání: '"Di Battista P."'
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:
Diez-Merida, J., Das, I., Di Battista, G., Diez-Carlon, A., Lee, M., Zeng, L., Watanabe, K., Taniguchi, T., Olsson, E., Efetov, D. K.
Magic-angle twisted bilayer graphene (MATBG) stands as one of the most versatile materials in condensed-matter physics due to its hosting of a wide variety of exotic phases while also offering convenient tunability. However, the fabrication of MATBG
Externí odkaz:
http://arxiv.org/abs/2405.11323
The superconducting (SC) state of magic-angle twisted bilayer graphene (MATBG) shows exceptional properties, as it consists of an unprecedentedly small electron (hole) ensemble of only ~ 10 power 11 carriers per square centimeter, which is five order
Externí odkaz:
http://arxiv.org/abs/2403.02049
Autor:
Acal, Christian, Aguilera, Ana M., Sarra, Annalina, Evangelista, Adelia, Di Battista, Tonio, Palermi, Sergio
Publikováno v:
Stochastic Environmental Research and Risk Assessment, 36(4), 1083-1101, 2022
Faced with novel coronavirus outbreak, the most hard-hit countries adopted a lockdown strategy to contrast the spread of virus. Many studies have already documented that the COVID-19 control actions have resulted in improved air quality locally and a
Externí odkaz:
http://arxiv.org/abs/2402.06066
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