Results 111 to 120 of about 975,712 (248)
Height-Preserving Transformations of Planar Graph Drawings
, 2014 There are numerous styles of planar graph drawings, such as straight-line drawings, poly-line drawings, orthogonal graph drawings and visibility representations. Given a planar drawing in one of these styles, can it be converted it to another style while
Biedl, Therese, Therese Biedl
core +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 +13 more
wiley +1 more source
Vector Bond Graph Method of Kineto-static Analysis for Planar Multi-body System with Gear Pair
Jixie chuandong, 2015 In order to increase the reliability and efficiency of the kineto-static analysis of complex planar multi-body system,the corresponding vector bond graph method is proposed.According to the kinematic constraint condition,the vector bond graph model of a ...
Wang Zhongshuang +3 more
doaj
Recognizing IC-Planar and NIC-Planar Graphs
Journal of Graph Algorithms and Applications, 2018 We prove that triangulated IC-planar graphs and triangulated $K_5$-free or $X4W$-free NIC-planar graphs can be recognized in cubic time. A graph is 1-planar if it can be drawn in the plane with at most one crossing per edge.
Franz Brandenburg
doaj +1 more source
On the depth of a planar graph
Discrete Mathematics, 1976 AbstractIn this paper, we have defined the concept of the depth of a planar graph. We show that, if G is a simple finite planar graph with p vertices and q edges and q > 3(p − 1) − p/2s−1, then the depth of G is at least equal to s.
Vinay G. Kane, Sanat K. Basu
openaire +2 more sources
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 +7 more
wiley +1 more source
Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends
Journal of Graph Algorithms and Applications, 2016 Given two planar graphs that are defined on the same set of vertices, a RAC simultaneous drawing is a drawing of the two graphs where each graph is drawn planar, no two edges overlap, and edges of one graph can cross edges of the other graph only ...
Michael Bekos +3 more
doaj +1 more source
Testing hereditary properties of nonexpanding bounded-degree graphs [PDF]
, 2007 We study graph properties that are testable for bounded-degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined graph property and graphs that are far from every graph having that property. It
Christian Sohler +5 more
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 +11 more
wiley +1 more source
Pathwidth of 2-Layer k-Planar Graphs
Computing in Geometry and TopologyA bipartite graph G = (X ∪ Y, E) is a 2-layer k-planar graph if it admits a drawing on the plane such that the vertices in X and Y are placed on two parallel lines respectively, edges are drawn as straight-line segments, and every edge involves at most ...
Yuto Okada
doaj +1 more source