Results 101 to 110 of about 23,983 (294)
Building Blocks of Upward Planar Digraphs
Journal of Graph Algorithms and Applications, 2007 The upward planarity testing problem consists of testing if a digraph admits a drawing Γ such that all edges in Γ are monotonically increasing in the vertical direction and no edges in Γ cross.
Patrick Healy, Karol Lynch
doaj +1 more source
On the Synchronization of Planar Automata [PDF]
, 2018 17 pages, 2 ...
J. Andres Montoya, Christian Nolasco
openaire +2 more sources
Advanced Functional Materials, EarlyView.Establishment of bidirectional communication behavior between natural and artificial cells. The first type of communication from natural dendritic cells to artificial polymeric cells was achieved via ATP release after cell lysis. The released ATP was taken up via gated UV‐controlled permeability increase of the polymeric membrane for performing ...
Ilona Kalte +6 more
wiley +1 more source
, 2016 In this article, we deepen the understanding of the connection between two long-standing graph drawing open problems, Simultaneous Embedding with Fixed Edges (SEFE-2) and Clustered Planarity (C-Planarity).
Da Lozzo, G. +3 more
core +1 more source
Advanced Functional Materials, EarlyView.The 2D carbon‐supported Gd–CuO exhibits strong interfacial electronic coupling, abundant oxygen vacancies, and highly exposed active sites, enabling efficient CO enrichment and C─C coupling toward selective and durable CO2‐to‐C2H4 conversion. ABSTRACT Copper‐based catalysts are promising for electrochemical CO2 reduction toward value‐added chemicals ...
Xueya Zhu +11 more
wiley +1 more source
Min-$k$-planar Drawings of Graphs
Journal of Graph Algorithms and ApplicationsThe 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.
Carla Binucci +9 more
doaj +1 more source
Morphing Planar Graph Drawings with Bent Edges
Journal of Graph Algorithms and Applications, 2011 We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend during the course of the morph. The morph is polynomial size and discrete: it uses a polynomial number of elementary steps, where each ...
Anna Lubiw, Mark Petrick
doaj +1 more source
Stacked planar optics: an application of the planar microlens
Applied Optics, 1982 In this paper we present a new development of the distributed-index planar microlens of 2.5-3-mm focal length and 0.15 N.A. and also show that it is usable with optical components in fiber communications. We then propose a concept of stacked planar optics consisting of a stack of arrayed planar microlenses and other optical components.
K, Iga +4 more
openaire +2 more sources
Planarity and edge poset dimension
, 1996 Different areas of discrete mathematics lead to intrinsically different characterizations of planar graphs. Planarity is expressed in terms of topology, combinatorics, algebra or search trees.
Ossona de Mendez, Patrice +1 more
core +1 more source
Fiber‐Based Wearable Electronics as Adaptive Biointerfaces for Healthcare Applications
Advanced Functional Materials, EarlyView.Fiber‐based wearable electronics have been extensively studied as adaptive healthcare biointerfaces. In this review, we classify and introduce fiber‐based systems according to biointerface design, conductive materials, transduction mechanisms, and healthcare applications, and provide a perspective on their translation toward reliable, continuous ...
Sangwoo Hong +5 more
wiley +1 more source