Results 81 to 90 of about 22,754 (291)
Clustered Planarity with Pipes [PDF]
, 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
Advanced 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
Additional PC-Tree Planarity Conditions
, 2004 Recent research efforts have produced new algorithms for solving planarity-related problems. One such method performs vertex addition using the PC-tree data structure, which is similar to but simpler than the well-known PQ-tree.
Boyer, John M., John M. Boyer
core +1 more source
1-Planarity of Graphs with a Rotation System
Journal 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
Morphology, Transport, and Dynamics of Protein Adsorption in Open‐Cell Metal Foam
Advanced Engineering Materials, EarlyView.Stainless steel (SS) open‐cell foams are shown to adsorb more protein per unit area than previously reported 316L SS and chromium oxide surfaces under static and flow conditions. An integrated approach combining 3D pore imaging, flow simulation, and protein adsorption experiments characterizes the foam’s performance.
Chinmaya Prerana Inguva +2 more
wiley +1 more source
The Electronic Journal of Combinatorics, 2019 We say that a graph $H$ is planar unavoidable if there is a planar graph $G$ such that any red/blue coloring of the edges of $G$ contains a monochromatic copy of $H$, otherwise we say that $H$ is planar avoidable. That is, $H$ is planar unavoidable if there is a Ramsey graph for $H$ that is planar. It follows from the Four-Color Theorem and a result of
Axenovich, M. +3 more
openaire +6 more sources
Advanced Engineering Materials, EarlyView.HEA interlayers offer a versatile route for joining high‐performance structural materials. Their compositional and structural design regulates interfacial reactions, suppresses brittle IMCs, and improves metallurgical bonding. Sandwich interlayers further integrate defect healing with precipitation strengthening, enabling improved strength–ductility ...
Lin Yuan +4 more
wiley +1 more source
, 2004 Planarity is an important concept in graph drawing. It is generally accepted that planar drawings are well understandable. Recently, several variations of planarity have been studied for advanced graph concepts such as k-level graphs and clustered graphs.
Michael Forster, Christian Bachmaier
core +1 more source
Geometric Optimization and Structural Analysis of Cable-Braced Gridshells on Freeform Surfaces
BuildingsIn freeform surface grid structures, quadrilateral meshes offer high visual transparency and simple joint connections, but their structural stability is relatively limited.
Xinye Li, Qilin Zhang
doaj +1 more source
Rotary 3D Printing With Integrated Electroplating
Advanced Engineering Materials, EarlyView.A rotary material extrusion platform integrates localized copper electroplating with printing and encapsulation to fabricate cylindrical polymer–metal structures containing fully embedded, low‐resistance conductive pathways that enable internal Joule heating and thermally activated shape‐memory responses.
Antonio Zagaria +5 more
wiley +1 more source