Results 91 to 100 of about 107,869,965 (249)

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

GeS as an Emerging OTS Material: Atomic Structure and Modeling of ON/OFF Switching

Advanced Functional Materials, EarlyView.
The structural puzzle of glassy GeS, an advanced memory‐selector material, has finally been disentangled, revealing a patchwork of mixed tetrahedral and trigonal species. Under a high electric field, over‐ and under‐coordinated Ge and S defects, together with three‐membered rings, form an interconnected network associated with localized and extended ...
Andrey Tverjanovich, Jörg C. Neuefeind, Chris J. Benmore, Daniele Fontanari, Anton Sokolov, Maxim Khomenko, Shinji Kohara, Aleksei Bytchkov, Takeshi Usuki, Maria Bokova, Mohammad Kassem, Pascal Masselin, Mariana Milochova, Eugene Bychkov   +13 more
wiley   +1 more source

Drawing Stressed Planar Graphs in Three Dimensions

, 1995
There is much current interest among researchers to find algorithms that will draw graphs in three dimensions. It is well known that every 3-connected planar graph can be represented as a strictly convex polyhedron. However, no practical algorithms exist
Patrick Garvan, Eades, Peter, Peter Eades, Garvan, Patrick   +3 more
core   +1 more source

Heuristics for Exact 1-Planarity Testing

Journal of Graph Algorithms and Applications
Since many real-world graphs are nonplanar, the study of graphs that allow few crossings per edge has been an active subfield of graph theory in recent years.
Miriam Münch, Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter   +3 more
doaj   +1 more source

Stack and Queue Layouts via Layered Separators

Journal of Graph Algorithms and Applications, 2018
It is known that every proper minor-closed class of graphs has bounded stack-number (a.k.a. book thickness and page number). While this includes notable graph families such as planar graphs and graphs of bounded genus, many other graph families are not
Vida Dujmović, Fabrizio Frati
doaj   +1 more source

Configuration‐Encoded Cell Alignment by Light‐Gated Silicon Photovoltaic Microcell Arrays

Advanced Functional Materials, EarlyView.
Light‐gated silicon photovoltaic microcells convert pulsed illumination into localized electrical cues. Arranging otherwise similar microcells into four‐lobed, six‐lobed, or circular patterns directs fibroblasts into corresponding local arrangements without wired stimulation.
Yifan Tao, Ilayda Namli, Joseph Christakiran Moses, Youdi Liu, Suihong Liu, Syed Hasan Askari Rizvi, Yasar Ozer Yilmaz, Ibrahim T. Ozbolat   +7 more
wiley   +1 more source

POHON DAN LINTASAN EULER DALAM GRAPH PLANAR [PDF]

, 1999
Graph planar adalah suatu graph yang dapat dilukiskan pada bidang sehingga tidak ada garis yang saling berpotongan. Dari suatu graph planar G dapat dibuat graph dual dan graph medial dari G, yang selanjutnya dapat ditemukan adanya hubungan antara graph ...
DEWI MASLUCHAH, 089511327
core   +1 more source

A Miniaturized Autonomous Thermomagnetic Generator

Advanced Functional Materials, EarlyView.
Micro, autonomous and high power thermomagnetic generator operating between a heat dissipator and a processor. ABSTRACT Thermomagnetic generators (TMG) are promising devices for converting low‐grade waste heat into electricity. Self‐actuation using permanent magnets is the key to autonomy.
Morgan Almanza, Doan Nguyen Ba, Nesrine Belkadi, Erika Fontana, Jean‐Eudes Duvauchelle, Sukhendu Sadhukhan, Loïc Becerra, Thibaut Devillers, Massimiliano Marangolo, Fabien Parrain, Nora M. Dempsey, Martino LoBue   +11 more
wiley   +1 more source

A note on the coprime graph of a group [PDF]

International Journal of Group Theory, 2016
In this paper we study the coprime graph of a group $G$. The coprime graph of a group $G$, is a graph whose vertices are elements of $G$ and two distinct vertices $x$ and $y$ are adjacent iff $(|x|,|y|)=1$.
Hamid Reza Dorbidi
doaj  

Endosomal Escape of siRNA Polyplexes: A Molecular Dynamics Perspective on Underlying Mechanisms

Advanced Functional Materials, EarlyView.
Molecular dynamics simulations reveal distinct endosomal escape mechanisms of siRNA nanoparticles, ranging from electrostatic membrane attachment to hydrophobic membrane fusion. Hydrophobic residues and anionic endosomal lipids emerge as key determinants of membrane disruption, linking molecular interactions to experimental delivery performance and ...
Katharina M. Steinegger, Min Jiang, Florian Belger, Fabian Link, Benjamin Winkeljann, Olivia M. Merkel   +5 more
wiley   +1 more source