Results 81 to 90 of about 107,869,965 (249)
On the size of planarly connected crossing graphs
We prove that if an $n$-vertex graph $G$ can be drawn in the plane such that each pair of crossing edges is independent and there is a crossing-free edge that connects their endpoints, then $G$ has $O(n)$ edges.
Eyal Ackerman +2 more
doaj +1 more source
The mantis shrimp telson reveals how ridged biological shields control deformation under impact. Inspired by this architecture, telson‐inspired ridged curved shells transform ridge geometry and macroscopic curvature into bidirectional snap‐through, tunable stiffness, and enhanced hysteretic energy dissipation for multifunctional architected materials ...
Phani Saketh Dasika +5 more
wiley +1 more source
Data Management Plan for the Planar Graph Classifier Project. More information is available on the project repository or in the report detailing the goal, training process, and result of the Planar Graph ...
Hummel, Matthias
core +1 more source
Not every directed acyclic graph (DAG) whose underlying undirected graph is planar admits an upward planar drawing. We are interested in pushing the notion of upward drawings beyond planarity by considering upward $k$-planar drawings of DAGs in which the
Patrizio Angelini +10 more
doaj +1 more source
An organic neuromorphic architecture for the classification of human motor behavior is presented and validated. It performs somatic integration by linearly combining the activity from three muscles. An investigation of synaptic weights is presented and discussed in relationship with the classification performance.
Ilenia Sergi +7 more
wiley +1 more source
Testing hereditary properties of nonexpanding bounded-degree graphs [PDF]
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 +5 more
core +1 more source
Planar Graph Classifier - README
README file of the Planar Graph Classifier detailing the project ...
Hummel, Matthias
core +1 more source
Universal Line-Sets for Drawing Planar 3-Trees
A set S of lines is universal for drawing planar graphs with n vertices if every planar graph G with n vertices can be drawn on S such that each vertex of G is drawn as a point on a line of S and each edge is drawn as a straight-line segment without ...
Md. Iqbal Hossain +3 more
doaj +1 more source
Versatile guanosine‐quadruplex (GQ) hydrogels are developed as dynamic biomatrices for cell culture. These scaffolds are fabricated under mild aqueous conditions, present improved stability, tunable mechanical properties within physiological ranges; fibrillar, porous microstructure, ion conductivity, and cytocompatibility.
Neha Thakur +10 more
wiley +1 more source
The Configuration Space of Two Particles Moving on a Graph [PDF]
In this thesis we study the configuration space, F (Γ, 2), of two particles moving without collisions on a graph Γ with a view to calculating the Betti numbers of this space. We develop an intersection theory for cycles in graphs inspired by the classical
BARNETT, KATHRYN
core

