Results 111 to 120 of about 23,983 (294)
, 2012 We present a characterization of planarity based on Trémaux trees (i.e. DFS trees), from which we deduce a rather simple planarity test algorithm. We finally recall a theorem on “cotree critical non-planar graphs” which very much simplifies the search ...
Ossona de Mendez, Patrice +3 more
core +1 more source
Advanced Functional Materials, EarlyView.An organic neuromorphic architecture for the classification of human motor behavior is presented and validated. It performs somatic integration by linearly combining the activity from three muscles. An investigation of synaptic weights is presented and discussed in relationship with the classification performance.
Ilenia Sergi +7 more
wiley +1 more source
Computing in Geometry and TopologyWe study straight-line drawings of graphs where the vertices are placed in convex position in the plane, i.e., convex drawings. We consider two families of graph classes with convex drawings: outer $k$-planar graphs, where each edge is crossed by at ...
Steven Chaplick +4 more
doaj +1 more source
Discrete Mathematics & Theoretical Computer ScienceNot every directed acyclic graph (DAG) whose underlying undirected graph is planar admits an upward planar drawing. We are interested in pushing the notion of upward drawings beyond planarity by considering upward $k$-planar drawings of DAGs in which the
Patrizio Angelini +10 more
doaj +1 more source
Advanced Functional Materials, EarlyView.A post‐growth method is demonstrated to realize energy‐tunable quantum emitters in GaAs/GaAsN/GaAs core–multishell nanowires on a Si substrate. By combining the N‐induced bandgap reduction with H‐ion irradiation, the GaAsN potential landscape is engineered, enabling isolated, narrow emission lines that function as single‐photon sources with g(2)(0) ∼ 0.
Akant Sagar Sharma +10 more
wiley +1 more source
OOPS: Optimized One-Planarity Solver via SAT
Journal of Graph Algorithms and ApplicationsWe present OOPS (Optimized One-Planarity Solver), a practical heuristic for recognizing 1-planar graphs and several important subclasses. A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once---a natural ...
Sergey Pupyrev
doaj +1 more source
Halogen Bonding in (Z)-2-Iodocinnamaldehyde
Molecules, 2013 Based on the bulkiness of the iodine atom, a non-planar conformation was expected for the title compound. Instead, its molecular structure is planar, as experimentally determined using single crystal X-ray diffraction, and confirmed theoretically by DFT ...
Miriam Rossi +3 more
doaj +1 more source
Advanced Functional Materials, EarlyView.Description: Indium metal serves as a reversible calcium‐alloying negative electrode. By transitioning from planar electrodes to powders and (sub‐)micron indium particles, the specific surface area is increased, improving the areal capacity density and cycling stability for calcium‐based batteries.
Wouter Monnens +10 more
wiley +1 more source
Computational Complexity of Graph Planarity Testing
, 2006 In this paper we will show that the problem of planarity testing is in SL (symmetric nondeterministic LOGSPACE). The main part of our proof is a reduction of the problem to planarity of graphs with maximal degree three. Note that usual replacing vertices
Krčál, Marek
core
Advanced Functional Materials, EarlyView.Versatile guanosine‐quadruplex (GQ) hydrogels are developed as dynamic biomatrices for cell culture. These scaffolds are fabricated under mild aqueous conditions, present improved stability, tunable mechanical properties within physiological ranges; fibrillar, porous microstructure, ion conductivity, and cytocompatibility.
Neha Thakur +10 more
wiley +1 more source