Results 141 to 150 of about 892,665 (298)
Bioinspired Adaptive Sensors: A Review on Current Developments in Theory and Application
This review comprehensively summarizes the recent progress in the design and fabrication of sensory‐adaptation‐inspired devices and highlights their valuable applications in electronic skin, wearable electronics, and machine vision. The existing challenges and future directions are addressed in aspects such as device performance optimization ...
Guodong Gong +12 more
wiley +1 more source
Metal‐free carbon catalysts enable the sustainable synthesis of hydrogen peroxide via two‐electron oxygen reduction; however, active site complexity continues to hinder reliable interpretation. This review critiques correlation‐based approaches and highlights the importance of orthogonal experimental designs, standardized catalyst passports ...
Dayu Zhu +3 more
wiley +1 more source
A topological graph is k-quasi-planar if it does not contain k pairwise crossing edges. A topological graph is simple if every pair of its edges intersect at most once (either at a vertex or at their intersection).
Andrew Suk, Suk, Andrew
core +1 more source
Degeneracies of Triangulated Graphs
A graph $G$ is $k$-degenerate if each subgraph has minimum degree at most $k$. The degeneracy\textbf{ }$D\left(G\right)$ is the smallest $k$ such that $G$ is $k$-degenerate.
Allan Bickle
doaj +1 more source
This review highlights the role of self‐assembled monolayers (SAMs) in perovskite solar cells, covering molecular engineering, multifunctional interface regulation, machine learning (ML) accelerated discovery, advanced device architectures, and pathways toward scalable fabrication and commercialization for high‐efficiency and stable single‐junction and
Asmat Ullah, Ying Luo, Stefaan De Wolf
wiley +1 more source
On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations
Hierarchical specifications of graphs have been widely used in many important applications, such as VLSI design, parallel programming and software engineering. A well known hierarchical specification model, considered in this work, is that of Lengauer [9,
Andreou, M. +9 more
core
Morphing Planar Graph Drawings via Orthogonal Box Drawings [PDF]
We give an algorithm to morph planar graph drawings that achieves small grid size at the expense of allowing a constant number of bends on each edge. The input is an n-vertex planar graph and two planar straight-line drawings of the graph on an O(n) × O ...
Spalding-Jamieson, Jack +2 more
core +1 more source
The 2-blowup of a graph is obtained by replacing each vertex with two non-adjacent copies; a graph is biplanar if it is the union of two planar graphs. We disprove a conjecture of Gethner that 2-blowups of planar graphs are biplanar: iterated Kleetopes ...
David Eppstein
doaj +1 more source
A Nb‐proximitized Josephson junction based on a WTe2/α‐Fe2O3 heterostructure exhibits a robust superconducting diode effect with programmable polarity. The diode direction can be trained by magnetic fields and switched by temperature cycling, revealing tunable finite‐momentum pairing states and competing superconducting states in symmetry‐broken ...
Enze Zhang +9 more
wiley +1 more source
The Configuration Space of Two Particles Moving on a Graph [PDF]
In this thesis we study the configuration space, F (Γ, 2), of two particles moving without collisions on a graph Γ with a view to calculating the Betti numbers of this space. We develop an intersection theory for cycles in graphs inspired by the classical
BARNETT, KATHRYN
core

