Results 61 to 70 of about 206,953 (273)
Outerplanar graph drawings with few slopes
, 2014 We consider straight-line outerplanar drawings of outerplanar graphs in which a small number of distinct edge slopes are used, that is, the segments representing edges are parallel to a small number of directions.
Bartosz Walczak +16 more
core +2 more sources
Advanced Engineering Materials, EarlyView.Hydrostatic bearings excel in high‐precision applications, but their performance hinges on a continuous external supply. This study evaluates various material combinations for sliding surfaces to mitigate damage during supply failures or misalignment and to discover the most effective materials identified for enhancing the reliability and efficiency of
Michal Michalec +6 more
wiley +1 more source
Untangling polygons and graphs
, 2008 Untangling is a process in which some vertices of a planar graph are moved to obtain a straight-line plane drawing. The aim is to move as few vertices as possible. We present an algorithm that untangles the cycle graph C_n while keeping at least \Omega(n^
D. Barnette +9 more
core +3 more sources
Advanced Engineering Materials, EarlyView.Using novel probe‐based metrics, this study evaluates lattice structures on criteria critical to cellular solid optimization. Triply‐periodic minimal surface (TPMS) lattices outperform other lattices, offering more predictable mechanical behavior in complex design spaces and, as a result, higher performance in optimized models.
Firas Breish +2 more
wiley +1 more source
Advanced Engineering Materials, EarlyView.Molecular dynamics simulations are advancing the study of ribonucleic acid (RNA) and RNA‐conjugated molecules. These developments include improvements in force fields, long‐timescale dynamics, and coarse‐grained models, addressing limitations and refining methods.
Kanchan Yadav, Iksoo Jang, Jong Bum Lee
wiley +1 more source
2-subcoloring is NP-complete for planar comparability graphs [PDF]
arXiv, 2017 A $k$-subcoloring of a graph is a partition of the vertex set into at most $k$ cluster graphs, that is, graphs with no induced $P_3$. 2-subcoloring is known to be NP-complete for comparability graphs and three subclasses of planar graphs, namely triangle-free planar graphs with maximum degree 4, planar perfect graphs with maximum degree 4, and planar ...
arxiv
Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends
, 2018 We study the following classes of beyond-planar graphs: 1-planar, IC-planar, and NIC-planar graphs. These are the graphs that admit a 1-planar, IC-planar, and NIC-planar drawing, respectively.
C Bachmaier +13 more
core +1 more source
Convex drawings of hierarchical planar graphs and clustered planar graphs [PDF]
, 1906 In this paper, we present results on convex drawings of hierarchical graphs and clustered graphs. A convex drawing is a planar straight-line drawing of a plane graph, where every facial cycle is drawn as a convex polygon.
Hong, Seok-Hee, Nagamochi, Hiroshi
core +1 more source
Deformation Behavior of La2O3‐Doped Copper during Equal Channel Angular Pressing
Advanced Engineering Materials, EarlyView.By additions of strengthening elements and/or structure optimization, the mechanical properties of copper can be increased while keeping favorable electric conductivity. By combining addition of La2O3 and processing by equal channel angular pressing, substructure development is achieved, leading to increase in microhardness to more than double the ...
Lenka Kunčická +2 more
wiley +1 more source
On Upward Drawings of Trees on a Given Grid
, 2017 Computing a minimum-area planar straight-line drawing of a graph is known to be NP-hard for planar graphs, even when restricted to outerplanar graphs. However, the complexity question is open for trees.
A Gregori +13 more
core +1 more source