Results 61 to 70 of about 29,288 (268)

New AI‐Assisted Approach for Expanding the Solution Space: Application to Lattice Structure Design

open access: yesAdvanced Engineering Materials, EarlyView.
This work introduces an innovative framework for designing structured materials by ex panding the design space through reparameterization of qualitative variables into continuous structural descriptors. Combined with machine‐learning‐based prediction and multi‐objective optimization, the approach enables the discovery of novel lattice architectures ...
G. H. Gahimbare   +5 more
wiley   +1 more source

Geometric RAC Simultaneous Drawings of Graphs

open access: yesJournal of Graph Algorithms and Applications, 2013
In this paper, we study the geometric RAC simultaneous drawing problem: Given two planar graphs that share a common vertex set, a geometric RAC simultaneous drawing is a straight-line drawing in which each graph is drawn planar, there are no edge ...
Evmorfia Argyriou   +3 more
doaj   +1 more source

Additive Manufacturing of Alumina‐Reinforced Elastomers

open access: yesAdvanced Engineering Materials, EarlyView.
Vat‐photopolymerized elastomers reinforced with platelet‐shaped alumina exhibited preferential orientation, reduced porosity, and significantly enhanced mechanical performance. A 3 wt% platelet loading increased tensile strength from 12.4 to 45.7 MPa, highlighting the critical role of filler morphology in elastomeric VPP composites.
Majid Barzegar Keyvani   +6 more
wiley   +1 more source

Subdivisions in Planar Graphs

open access: yesJournal of Combinatorial Theory, Series B, 1998
Given four distinct vertices in a 4-connected planar graph \(G\), we characterize when the graph \(G\) contains a \(K_4\)-subdivision with the given vertices as its degree three vertices. This result implies the following conjecture of Robertson and Thomas: a 5-connected planar graph has no \(K_4\)-subdivision with specified degree three vertices, if ...
openaire   +2 more sources

Random planar graphs

open access: yesJournal of Combinatorial Theory, Series B, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
McDiarmid, C, Steger, A, Welsh, D
openaire   +4 more sources

Extrusion‐Based Additive Manufacturing of Advanced Ceramics: Strengthening Mechanisms and Process Optimization Review

open access: yesAdvanced Engineering Materials, EarlyView.
This review comprehensively evaluates extrusion‐based additive manufacturing for advanced ceramics, detailing feedstock options and key process parameters. By critically addressing defect mechanisms like porosity and cracking, the work highlights optimization strategies through machine learning and advanced postprocessing.
Meisam Bakhtiari   +4 more
wiley   +1 more source

Beyond Outerplanarity

open access: yesComputing in Geometry and Topology
We study straight-line drawings of graphs where the vertices are placed in convex position in the plane, i.e., convex drawings. We consider two families of graph classes with convex drawings: outer $k$-planar graphs, where each edge is crossed by at ...
Steven Chaplick   +4 more
doaj   +1 more source

On the Effect of Creep on Local Lattice Orientation in Single‐Crystal Ni‐Based Superalloy Microstructures

open access: yesAdvanced Engineering Materials, EarlyView.
During creep of a single‐crystal Ni‐based superalloy, the overall crystal orientation is observed to remain constant while the microstructure evolves. Despite the lack of macroscopic rotation, small (<1°) rotations are observed on the submicron size scale and are accommodated by counteracting rotations over the scale of several micrometers.
E. J. Payton   +3 more
wiley   +1 more source

Algorithm and Experiments in Testing Planar Graphs for Isomorphism

open access: yesJournal of Graph Algorithms and Applications, 2004
We give an algorithm for isomorphism testing of planar graphs suitable for practical implementation. The algorithm is based on the decomposition of a graph into biconnected components and further into SPQR-trees.
Jacek Kukluk   +2 more
doaj   +1 more source

Clique Planar Graphs

open access: yesElectronic Notes in Discrete Mathematics, 2001
Abstract Abstract We generalize the idea of extended triangles of a graph G by considering a family of completes of G instead of the clique family of G. We characterize Helly and 3 - Helly Planar Graphs using extended triangles. We prove that if a planar graph is a clique graph then any one of its extended triangles is a clique graph.
Liliana Alcón, Marisa Gutierrez
openaire   +1 more source

Home - About - Disclaimer - Privacy