Results 61 to 70 of about 13,908 (261)
Radial Level Planarity Testing and Embedding in Linear Time
Journal of Graph Algorithms and Applications, 2005 A graph with an ordered k-partition of the vertices is radial level planar if there is a strictly outward drawing on k concentric levels without crossings.
Christian Bachmaier +2 more
doaj +1 more source
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective To explore how cerebral hypoxia and Normal‐Appearing White Matter (NAWM) integrity affect MS lesion burden and clinical course. Methods Seventy‐nine MS patients, including 13 clinically isolated syndrome (CIS) patients and 66 relapsing–remitting multiple sclerosis (RRMS) patients, and 44 healthy controls (HCs) were recruited from ...
Xinli Wang +8 more
wiley +1 more source
Low‐Angle Grain Boundaries and Re‐Segregation in Single‐Crystalline Ni‐Base Superalloys
Advanced Engineering Materials, EarlyView.This work demonstrates that Re‐segregation at low‐angle grain boundaries (LAGBs) in Ni‐base superalloys is influenced by misorientation angle. Advanced microscopy and atom probe tomography reveal that higher misorientation angles increases Re‐segregation.
Alireza B. Parsa +9 more
wiley +1 more source
Analysis of the response surface method for optimising the flatness of ceramic-metal brazing
Hanjie xuebaoCeramic-to-metal packaging is widely used as a key process in electronic vacuum devices in integrated circuit packaging, medical devices, and defence.The flatness of the two connections determines the reliability of the chip, and it is of great ...
Guanghui WANG +4 more
doaj +1 more source
NanomaterialsThe selection of solvent is pivotal in liquid-phase exfoliation (LPE), as an ideal solvent minimizes the energy required to disrupt the interlayer attractive interactions while stabilizing exfoliated layers to prevent re-agglomeration.
Shunnian Wu +3 more
doaj +1 more source
Journal of Graph Algorithms and Applications, 2008 This paper investigates a new direction in the area of cluster planarity by addressing the following question: Let G be a graph along with a hierarchy of vertex clusters, where clusters can partially intersect.
Walter Didimo +2 more
doaj +1 more source
Advanced Engineering Materials, EarlyView.New features on yttria‐stabilized zirconia after exposure at 1500°C: Newly discovered pyramidal structures on an old material. After exposure at 1550°C on the cross section of YSZ new features, namely pyramidal structures are discovered. These structures grow with time, increase in numbers, appear as singularities, are often arranged in strings, and ...
Doris Sebold +2 more
wiley +1 more source
Constrained Planarity in Practice -- Engineering the Synchronized Planarity Algorithm
Journal of Graph Algorithms and ApplicationsIn the constrained planarity setting, we ask whether a graph admits a planar drawing that additionally satisfies a given set of constraints. These constraints are often derived from very natural problems; prominent examples are Level Planarity, where ...
Simon Dominik Fink, Ignaz Rutter
doaj +1 more source
Hanani-Tutte for Radial Planarity
Journal of Graph Algorithms and Applications, 2017 A drawing of a graph $G$ is radial if the vertices of $G$ are placed on concentric circles $C_1, \ldots, C_k$ with common center $c$, and edges are drawn radially: every edge intersects every circle centered at $c$ at most once.
Radoslav Fulek +2 more
doaj +1 more source
Towards Defect Phase Diagrams: From Research Data Management to Automated Workflows
Advanced Engineering Materials, EarlyView.A research data management infrastructure is presented for the systematic integration of heterogeneous experimental and simulation data required for defect phase diagrams. The approach combines openBIS with a companion application for large‐object storage, automated metadata extraction, provenance tracking and federated data access, thereby supporting ...
Khalil Rejiba +5 more
wiley +1 more source