Results 71 to 80 of about 28,812 (264)
NP-completeness of the Planar Separator Problems
Journal of Graph Algorithms and Applications, 2006 For a given graph G, the Separator Problem asks whether a vertex or edge set of small cardinality (or weight) exists whose removal partitions G into two disjoint graphs of approximately equal sizes.
Junichiro Fukuyama
doaj +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
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
Computing in Geometry and TopologyWe 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
A First Order Logic Definition of Beyond-Planar Graphs
Journal of Graph Algorithms and Applications, 2018 Beyond-planarity is a collective term for classes of graphs that extend the planar graphs and are defined by drawings with restrictions on crossings. Examples are 1-planar, fan-planar, fan-crossing free, and quasi-planar graphs. We define these and other
Franz Brandenburg
doaj +1 more source
3D Visibility Representations of 1-planar Graphs [PDF]
, 2018 We prove that every 1-planar graph G has a z-parallel visibility representation, i.e., a 3D visibility representation in which the vertices are isothetic disjoint rectangles parallel to the xy-plane, and the edges are unobstructed z-parallel visibilities between pairs of rectangles.
Patrizio Angelini +3 more
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
Advanced Engineering Materials, EarlyView.This article investigates the dependence of the properties on the manufacturing orientation in the form of the inclination angle to the build plate of LPBF‐fabricated NiTi rods with a diameter of 150–220 µm. Metallographic, chemical, thermal, and mechanical characterization show behavior under identical manufacturing conditions that ranges from ...
Sandra Herzig +2 more
wiley +1 more source
Drawing Planar Graphs with Reduced Height
Journal of Graph Algorithms and Applications, 2017 A polyline (resp., straight-line) drawing $\Gamma$ of a planar graph $G$ on a set $L_k$ of $k$ parallel lines is a planar drawing that maps each vertex of $G$ to a distinct point on $L_k$ and each edge of $G$ to a polygonal chain (resp ...
Stephane Durocher, Debajyoti Mondal
doaj +1 more source
Discrete Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources