Results 71 to 80 of about 892,665 (298)

Ontology‐Aligned Structuring and Reuse of Multimodal Materials Data and Workflows Toward Automatic Reproduction

Advanced Engineering Materials, EarlyView.
Reproduction of stacking fault energy calculations from literature with a semi‐automated large language model‐assisted extraction procedure: extraction of simulation protocol, atomistic structures, computational parameters, and reported results, ontology alignment, knowledge graph construction and, finally, recomputation forvalidation.
Sepideh Baghaee Ravari, Abril Azocar Guzman, Sarath Menon, Stefan Sandfeld, Tilmann Hickel, Markus Stricker   +5 more
wiley   +1 more source

Geometric RAC Simultaneous Drawings of Graphs

Journal 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, Michael Bekos, Michael Kaufmann, Antonios Symvonis   +3 more
doaj   +1 more source

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

Advanced 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, Y. Beideler, D. Chune, R. De Guio, T. Roland, H. Chibane   +5 more
wiley   +1 more source

Testing hereditary properties of nonexpanding bounded-degree graphs [PDF]

, 2007
We study graph properties that are testable for bounded-degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined graph property and graphs that are far from every graph having that property. It
Christian Sohler, Shapira, Asaf, Asaf Shapira, Artur Czumaj, Sohler, Christian, Czumaj, Artur   +5 more
core   +1 more source

Beyond Outerplanarity

Computing 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, Myroslav Kryven, Giuseppe Liotta, Andre Löffler, Alexander Wolff   +4 more
doaj   +1 more source

Random planar graphs

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

Additive Manufacturing of Alumina‐Reinforced Elastomers

Advanced 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, Zongwen Fu, Robert Göstl, Hamed Shokri, Carmine Putignano, Gianluca Percoco, Bilal Gökce   +6 more
wiley   +1 more source

OntOMat: Toward Ontology‐Based Product and Process Design Engineering and Optimization Solutions Fueling Circular Value Chains

Advanced Engineering Materials, EarlyView.
The OntOMat ontology establishes a structured framework for polymer matrix fiber reinforced composite materials, integrating manufacturing processes, characterization methods, and multiscale design through the VDI/VDE 3682 formalized process description standard.
Nicolas Christ, Jörg Hohe, Martin Kördel, Michael Giese, Niklas Toffert, Christian Seidel, Olaf Rehme, Patrik Schneider, Oliver Focke, Elie Abi Aoun, Claas Falldorf, Beñat Gutierrez, Alexandra Kühn, Sven Torstrick-von der Lieth, Christoph Herden, Erik Johannsen, Jan‐Uwe R. Schmidt, Felix Winkelmann, Andreas Schott, Daniel Schott   +19 more
wiley   +1 more source

Algorithm and Experiments in Testing Planar Graphs for Isomorphism

Journal 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, Lawrence Holder, Diane Cook   +2 more
doaj   +1 more source

Subdivisions in Planar Graphs

Journal 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