Results 101 to 110 of about 22,754 (291)

Ranking and Unranking of the Planar Embeddings of a Planar Graph

Let $\mathcal{G}$ be the set of all the planar embeddings of a (not necessarily connected) $n$-vertex graph $G$. We present a bijection $Φ$ from $\mathcal{G}$ to the natural numbers in the interval $[0 \dots |\mathcal{G}| - 1]$. Given a planar embedding $\mathcal{E}$ of $G$, we show that $Φ(\mathcal{E})$ can be decomposed into a sequence of $O(n ...
Giuseppe Di Battista, Fabrizio Grosso, Giulia Maragno, Maurizio Patrignani   +3 more
openaire   +3 more sources

Parameterized Complexity of 1-Planarity

Journal of Graph Algorithms and Applications, 2018
We consider the problem of drawing graphs with at most one crossing per edge. These drawings, and the graphs that can be drawn in this way, are called $1$-planar.
Michael Bannister, Sergio Cabello, David Eppstein   +2 more
doaj   +1 more source

Wearable Smart Patches on Sustainable Chitosan With Reversible Microbial Growth‐Inhibitory Properties

Advanced Functional Materials, EarlyView.
ABSTRACT Chitosan, a polysaccharide upcycled from biowaste, has long promised sustainable, biocompatible, and antimicrobial films and devices, an appeal reinforced by its recent regulatory recognition, with several chitosan‐based antibacterial dressings gaining clearance through the Food and Drug Administration's 510(k) pathway.
Jacopo Nicoletti, Kubra Kocak, Andrea Michel, Enrico Cavarzerani, Ali Raza, Petr Rohzin, Nouha Loudhaief, Saimir Frroku, Nicolò Baldovin, Hazrat Bilal, Alvise Perosa, Maurizio Selva, Flavio Rizzolio, Luca Sbuelz, Sabrina Tamburini, Domenico De Fazio, Giovanni Antonio Salvatore   +16 more
wiley   +1 more source

Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces

Journal of Graph Algorithms and Applications, 2009
Let C be a clustered graph and suppose that the planar embedding of its underlying graph is fixed. Is testing the c-planarity of C easier than in the variable embedding setting?
Giuseppe Di Battista, Fabrizio Frati
doaj   +1 more source

Optoelectronic Synaptic Devices Using Molecular Telluride Phase‐Change Inks for Three‐Factor Learning

Advanced Functional Materials, EarlyView.
Optoelectronic synaptic devices based on solution‐processed molecular telluride GST‐225 phase‐change inks are demonstrated for three‐factor learning. A global optical signal broadcast through a silicon waveguide induces non‐volatile conductance updates exclusively in locally electrically flagged memristors.
Kevin Portner, Dhananjeya Kumaar, Giacomo Torti, Killian Keller, Till Zellweger, Florian M. Schenk, Christoph Weilenmann, Daniel Chelladurai, Vara Prasad Jonnalagadda, Ghazi Sarwat Syed, Vanessa Wood, Jürg Leuthold, Alexandros Emboras, Maksym Yarema, Mathieu Luisier   +14 more
wiley   +1 more source

Fully Additive Vertical Organic Electrochemical Transistors on Renewable and Compostable Substrates Enable Ultrasensitive Bioelectronics

Advanced Functional Materials, EarlyView.
Fully additive vertical organic electrochemical transistors (vOECTs) with channel‐length of 226 nm on a 50 µm compostable substrate achieve >106 current modulation and ∼36 mS transconductance. Ion‐selective integration enables 1.1 mA dec−1 sensitivity and 36 µm detection limit, highlighting a scalable platform for sustainable electronics and ...
Giulia Frusconi, Samuele Lavelli, Zsolt M. Kovács‐Vajna, Fabrizio Torricelli   +3 more
wiley   +1 more source

The Complexity of Planarity Testing [PDF]

, 2003
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely conjectured that L = SL [Sak96]. The upper bound of SL matches the lower
Allender, Eric, Meena Mahajan, Eric Allender, Mahajan, Meena   +3 more
core   +1 more source

Structural Parameterizations of $k$-Planarity

Journal of Graph Algorithms and Applications
The concept of $k$-planarity is extensively studied in the context of Beyond Planarity. A graph is $k$-planar if it admits a drawing in the plane in which each edge is crossed at most $k$ times.
Tatsuya Gima, Yasuaki Kobayashi, Yuto Okada   +2 more
doaj   +1 more source

Switch-Regular Upward Planarity Testing of Directed Trees

Journal of Graph Algorithms and Applications, 2011
Upward planar drawings of digraphs are crossing free drawings where all edges flow in the upward direction. The problem of deciding whether a digraph admits an upward planar drawing is called the upward planarity testing problem, and it has been widely ...
Carla Binucci, Emilio Di Giacomo, Walter Didimo, Aimal Rextin   +3 more
doaj   +1 more source

Spatially Modulated Morphotropic Phase Boundaries in a Compressively Strained Multiferroic Thin Film

Advanced Functional Materials, EarlyView.
ABSTRACT The coexisting rhombohedral‐like (R′, MA) and tetragonal‐like (T′, MC) monoclinic phases in compressively strained bismuth ferrite thin films exhibit exceptional piezoelectric and magnetic properties. While previous studies have largely focused on probing the morphotropic phase boundaries (MPBs) comprising ordered R′/T′ twins, their self ...
Ting‐Ran Liu, Xiangwei Guo, Sajid Husain, Maya Ramesh, Pushpendra Gupta, Darrell Schlom, Ramamoorthy Ramesh, Yu‐Tsun Shao   +7 more
wiley   +1 more source