Results 91 to 100 of about 424,972 (258)
Orthogonal Graph Drawing with Inflexible Edges
, 2015 We consider the problem of creating plane orthogonal drawings of 4-planar graphs (planar graphs with maximum degree 4) with constraints on the number of bends per edge.
Bläsius, Thomas +2 more
core +1 more source
Transfer of Energy and Momentum Between Magnetoactive Surface Microstructure and a Solid Object
Advanced Engineering Materials, EarlyView.We demonstrate that magnetoactive multilamellar arrays subjected to a rotating magnetic field can function as platforms for controlled transport of physical objects. Through systematic experimental investigation, we elucidate the underlying physical mechanisms determining the upper limit of the achievable transportation speed in such magnetic “conveyor‐
Arne Geldof +9 more
wiley +1 more source
Journal of Computational Geometry, 2016 We define strict confluent drawing, a form of confluent drawing in which the existence of an edge is indicated by the presence of a smooth path through a system of arcs and junctions (without crossings), and in which such a path, if it exists, must be ...
David Eppstein +5 more
doaj +1 more source
Advanced Functional Materials, EarlyView.PBTTT‐OR‐R, a C14‐alkoxy/alkyl‐PBTTT polymer derivative, is of substantial interest for optoelectronics due to its specific fullerene intercalation behavior and enhanced charge‐transfer absorption. Comparing this polymer with (S) and without (O) homocoupling defects reveals that PBTTT‐OR‐R(O) forms stable co‐crystals with PC61BM, while PBTTT‐OR‐R(S ...
Zhen Liu +14 more
wiley +1 more source
Drawing Big Graphs using Spectral Sparsification
, 2017 Spectral sparsification is a general technique developed by Spielman et al. to reduce the number of edges in a graph while retaining its structural properties.
Eades, Peter +2 more
core +1 more source
Upper Bounds for the Strong Chromatic Index of Halin Graphs
Discussiones Mathematicae Graph Theory, 2018 The strong chromatic index of a graph G, denoted by χ′s(G), is the minimum number of vertex induced matchings needed to partition the edge set of G. Let T be a tree without vertices of degree 2 and have at least one vertex of degree greater than 2.
Hu Ziyu, Lih Ko-Wei, Liu Daphne Der-Fen
doaj +1 more source
Modifying Orthogonal Drawings for Label Placement
Algorithms, 2016 In this paper, we investigate how one can modify an orthogonal graph drawing to accommodate the placement of overlap-free labels with the minimum cost (i.e., minimum increase of the area and preservation of the quality of the drawing).
Konstantinos G. Kakoulis +1 more
doaj +1 more source
Advanced Functional Materials, EarlyView.A lack of standard approaches for testing and reporting the performance of metal halide perovskites and organic semiconductor radiation detectors has resulted in inconsistent interpretation of performance parameters, impeding progress in the field. This Perspective recommends key metrics and experimental details, which are suggested for reporting in ...
Jessie A. Posar +8 more
wiley +1 more source
The Complexity of Drawing Graphs on Few Lines and Few Planes
, 2016 It is well known that any graph admits a crossing-free straight-line drawing in $\mathbb{R}^3$ and that any planar graph admits the same even in $\mathbb{R}^2$. For a graph $G$ and $d \in \{2,3\}$, let $\rho^1_d(G)$ denote the minimum number of lines in $
D Bienstock +17 more
core +1 more source
Advanced Functional Materials, EarlyView.Biofabrication aims at providing innovative technologies and tools for the fabrication of tissue‐like constructs for tissue engineering and regenerative medicine applications. By integrating multiple biofabrication technologies, such as 3D (bio) printing with fiber fabrication methods, it would be more realistic to reconstruct native tissue's ...
Waseem Kitana +2 more
wiley +1 more source