Results 61 to 70 of about 22,755 (290)

Hanani-Tutte for Radial Planarity

open access: yesJournal 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

Simulation‐Based Analysis of Insert Pull‐Out in Nickel‐Polyurethane Hybrid Foams Using CT‐Derived Geometries

open access: yesAdvanced Engineering Materials, EarlyView.
CT‐based finite element simulations combined with in situ X‐ray computed tomography are used to analyze insert pull‐out in nickel‐coated polymer foams. Despite variations in material parameters, deformation consistently concentrates within a narrow annular region around the insert.
Yannik Bautz   +4 more
wiley   +1 more source

Analysis of the response surface method for optimising the flatness of ceramic-metal brazing

open access: yesHanjie xuebao
Ceramic-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

Quantitative Criteria for Solvent Selection in Liquid-Phase Exfoliation: Balancing Exfoliation and Stabilization Efficiency

open access: yesNanomaterials
The 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

C-Planarity of C-Connected Clustered Graphs

open access: yesJournal of Graph Algorithms and Applications, 2008
We present the first characterization of c-planarity for c-connected clustered graphs. The characterization is based on the interplay between the hierarchy of the clusters and the hierarchies of the triconnected and biconnected components of the ...
Pier Francesco Cortese   +4 more
doaj   +1 more source

Fabrication Routes for Ionic Conducting Fiber Strain Sensors

open access: yesAdvanced Engineering Materials, EarlyView.
Ionic conducting fiber strain sensors (ICFSs) offer compliant, textile‐integrable sensing. Thus far, the commercialization of ICFSs has been constrained by fiber fabrication routes. This review provides a fabrication‐centric analysis of ICFSs correlating processing strategies with material properties and scalability.
Leo John Kershaw   +3 more
wiley   +1 more source

Rapidly Solidified High‐Strength Invar 36 Prepared by Planar‐Flow Melt Spinning

open access: yesAdvanced Engineering Materials, EarlyView.
The Invar 36 alloy was rapidly solidified using the planar‐flow melt‐spinning technique. Ribbon samples with thicknesses ranging from 20 to 160 mm were produced. As the grain size of the ribbon decreased to sub‐micron levels, the hardness increased by more than 2 times.
Bekir Akgül, Mehmet Kul
wiley   +1 more source

Gallium Microalloying in Bi–Sn Solders: Interfacial Phase Formation, Wettability, and Long‐Term Shear Reliability Under Isothermal Aging

open access: yesAdvanced Engineering Materials, EarlyView.
Gallium microalloying redirects interfacial reactions in low‐temperature Bi–Sn solders from Cu–Sn toward Cu–Ga intermetallic formation. The resulting Cu–Ga layer suppresses intermetallic growth during thermal aging, alters fracture pathways, and improves interfacial stability.
Iva Králová   +6 more
wiley   +1 more source

1-Planarity of Graphs with a Rotation System

open access: yesJournal of Graph Algorithms and Applications, 2015
A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. 1-planarity is known NP-hard, even for graphs of bounded bandwidth, pathwidth, or treewidth, and for near-planar graphs in which an edge is added to a planar
Christopher Auer   +3 more
doaj   +1 more source

Clustered Planarity with Pipes [PDF]

open access: yes, 2016
We study the version of the C-Planarity problem in which edges connecting the same pair of clusters must be grouped into pipes, which generalizes the Strip Planarity problem. We give algorithms to decide several families of instances for the two variants
Angelini, Patrizio, Da Lozzo, Giordano
core   +1 more source

Home - About - Disclaimer - Privacy