Results 81 to 90 of about 1,484,168 (305)
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 +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 +2 more
doaj +1 more source
Posets and planar graphs [PDF]
Journal of Graph Theory, 2005 AbstractUsually dimension should be an integer valued parameter. We introduce a refined version of dimension for graphs, which can assume a value [t − 1 ↕ t], thought to be between t − 1 and t. We have the following two results: (a) a graph is outerplanar if and only if its dimension is at most [2↕3].
Stefan Felsner, William T. Trotter
openaire +1 more source
Advanced 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
Planarization of Clustered Graphs [PDF]
, 2002 We propose a planarization algorithm for clustered graphs and experimentally test its efficiency and effectiveness. Further, we integrate our planarization strategy into a complete topology-shape-metrics algorithm for drawing clustered graphs in the orthogonal drawing convention.
Di Battista G. +2 more
openaire +3 more sources
Advanced Engineering Materials, EarlyView.Residual adhesive after electrode loading in adhesive‐assisted resistance spot welding is quantified through a traceable experimental‐to‐digital workflow. Chromatic confocal topography provides calibrated surface‐height data, while OpenCV detects the electrode imprint and integrates adhesive height into comparable volume metrics.
Sung‐Min Wi, Jiangdong Zhao
wiley +1 more source
1-Visibility Representations of 1-Planar Graphs
Journal of Graph Algorithms and Applications, 2014 A 1-visibility representation of a graph displays each vertex as a horizontal vertex-segment, called a bar, and each edge as a vertical edge-segment between the segments of the vertices, such that each edge-segment crosses at most one vertex-segment and ...
Franz Brandenburg
doaj +1 more source
On the depth of a planar graph
Discrete Mathematics, 1976 AbstractIn this paper, we have defined the concept of the depth of a planar graph. We show that, if G is a simple finite planar graph with p vertices and q edges and q > 3(p − 1) − p/2s−1, then the depth of G is at least equal to s.
Vinay G. Kane, Sanat K. Basu
openaire +2 more sources
Advanced Engineering Materials, EarlyView.We apply a foundational machine‐learning interatomic potential based on the graph atomic cluster expansion (GRACE) to simulate the commercial Ni‐based single‐crystal superalloy CMSX‐4. Hybrid Monte‐Carlo/molecular dynamics sampling resolves short‐range order in the γ phase and L12 sublattice occupancies in the γ’ phase and connects them to stacking ...
Aditya Vishwakarma +4 more
wiley +1 more source
Augmenting the Connectivity of Planar and Geometric Graphs
Journal of Graph Algorithms and Applications, 2012 In this paper we study connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) by adding edges such that the resulting graph keeps the property.
Ignaz Rutter, Alexander Wolff
doaj +1 more source