Results 81 to 90 of about 13,908 (261)
Parameterized Complexity of 1-Planarity
We consider the problem of drawing graphs with at most one crossing per edge. These drawings, and the graphs that can be drawn in this way, are called $1$-planar.
Michael Bannister +2 more
doaj +1 more source
In Situ Micromechanical Study of Bimodal γ′–γ″ Precipitate Assemblies in Ni–Cr–Al–Nb Superalloy
A Ni–Cr–Al–Nb superalloy with a bimodal γ′–γ″ precipitate distribution is developed. Composite precipitate assemblies form through heterogeneous nucleation, effectively impeding dislocation motion. Micropillar compression reveals high strength at room and elevated temperatures, governed by precipitate shearing, with coupled faulting mechanisms ...
Ujjval Bansal +4 more
wiley +1 more source
Low‐voltage FIB‐SEM tomography combined with a image preprocessing pipeline improves phase contrast and enables reliable machine‐learning segmentation of conductive networks in lithium‐ion battery electrodes. Structural descriptors are extracted from segmented images, done semimanually and automated, and compared.
Lisa Beran +6 more
wiley +1 more source
Dislocation cutting of γ′ precipitates in Ni‐based superalloys is investigated by linking atomistic simulations with discrete dislocation dynamics. The critical cutting stress is shown to be governed by the antiphase boundary energy, while line tension effects promote edge‐preferred cutting.
Frédéric Houllé +9 more
wiley +1 more source
Grain boundary triple junctions are an essential ingredient of the microstructure of polycrystalline materials. In this study, a triple junction is observed using atomic‐resolution scanning transmission electron microscopy and characterized. Computer simulations reveal that the junction has a dislocation character that is determined by the joining ...
Tobias Brink +4 more
wiley +1 more source
Ranking and Unranking of the Planar Embeddings of a Planar Graph
Let $\mathcal{G}$ be the set of all the planar embeddings of a (not necessarily connected) $n$-vertex graph $G$. We present a bijection $Φ$ from $\mathcal{G}$ to the natural numbers in the interval $[0 \dots |\mathcal{G}| - 1]$. Given a planar embedding $\mathcal{E}$ of $G$, we show that $Φ(\mathcal{E})$ can be decomposed into a sequence of $O(n ...
Giuseppe Di Battista +3 more
openaire +2 more sources
Sol–gel‐derived ZnO–rGO hybrid nanoparticles enable Al7075 powder‐metallurgy composites to achieve concurrent gains in hardness and thermal conductivity while markedly lowering friction and wear. The hybrid architecture couples ZnO‐based load support with rGO‐assisted lamellar sliding and heat spreading, revealing a promising route toward lightweight ...
Bunyamin Aksakal +3 more
wiley +1 more source
Column planarity and partially-simultaneous geometric embedding
We introduce the notion of column planarity of a subset $R$ of the vertices of a graph $G$. Informally, we say that $R$ is column planar in $G$ if we can assign $x$-coordinates to the vertices in $R$ such that any assignment of $y$-coordinates to ...
Luis Barba +5 more
doaj +1 more source
This work studies the anisotropic behavior of circular notched tensile specimens of Ni‐base superalloy single crystals during high‐temperature tensile creep along [001], [110], and [111]. Correlative scale‐bridging imaging of specimens reveals early rupture along [110] because 1) plastic deformation proceeds faster at notch center; 2) more (brittle ...
Leonardo Agudo Jácome +6 more
wiley +1 more source
Min-$k$-planar Drawings of Graphs
The 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

