Results 51 to 60 of about 116,078 (220)
Unit disk graph recognition is NP-hard
AbstractUnit disk graphs are the intersection graphs of unit diameter closed disks in the plane. This paper gives a polynomial-time reduction from SATISFIABILITY to the problem of recognizing unit disk graphs. Equivalently, it shows that determining if a graph has sphericity 2 or less, even if the graph is planar or is known to have sphericity at most ...
Heinz Breu, David G. Kirkpatrick
openaire +2 more sources
Biomimetic glycosaminoglycan analog hydrogels exhibit suitable and robust mechanical properties, as well as hemocompatibility and biocompatibility, making them ideal for the embolization of intracranial aneurysms. Notably, the hydrogel's environment‐selective swelling properties enable complete blockage of the aneurysm cavity while preventing ...
Sarit S. Sivan+8 more
wiley +1 more source
This proof‐of‐concept study involves high‐throughput teratogenicity screening of compounds using XEn/EpiCs, a 3D stem cell‐based embryo model, within microwells. The term ‘morphotoxicity’ is introduced to complement traditional cytotoxicity assays through automated feature extraction and machine‐learning‐assisted classification of morphologies.
Vinidhra Shankar+4 more
wiley +1 more source
Maxclique and unit disk characterizations of strongly chordal graphs
Maxcliques (maximal complete subgraphs) and unit disks (closed neighborhoods of vertices) sometime play almost interchangeable roles in graph theory. For instance, interchanging them makes two existing characterizations of chordal graphs into two new characterizations.
De Caria, Pablo Jesús, McKee, Terry A.
openaire +4 more sources
Hybrid NPs are developed as efficient, scalable nanocarriers for in vitro microRNA delivery, ensuring high loading efficiency, controlled release, physiological and long‐term storage stability. They outperform commercial lipid‐based reagents in terms of transfection efficiency and biocompatibility.
Letizia Nicoletti+11 more
wiley +1 more source
Connectivity of Graphs Induced by Directional Antennas [PDF]
This paper addresses the problem of finding an orientation and a minimum radius for directional antennas of a fixed angle placed at the points of a planar set S, that induce a strongly connected communication graph. We consider problem instances in which
Damian, Mirela, Flatland, Robin
core
We consider the problem of computing all-pairs shortest paths in a directed graph with real weights assigned to vertices. For an $n\times n$ 0-1 matrix $C,$ let $K_{C}$ be the complete weighted graph on the rows of $C$ where the weight of an edge ...
Lingas, Andrzej, Sledneu, Dzmitry
core +1 more source
Colonoscopic continuum robots lack sensing, endangering intestinal tissue. An ideal sensing array is hard to integrate. This work introduces a 3D crosslinked stretchable E‐armor with full‐coverage and multiplexing. It has bimodal sensing, forms a triboelectric synapse, uses CNN‐LSTM, and has a hydrogel and innovative triboelectric materials.
Yuyang Sun+8 more
wiley +1 more source
A covalent adaptable network with dynamic disulfide bonds (DS‐CAN) can rearrange its molecular topology through heating or UV irradiation. When combined with ferromagnetic particles, its photoresponsiveness at room temperature enables contactless, spatiotemporal regulation of dynamic bond exchanges during magnetomechanical actuation.
Yeomyung Yoon+6 more
wiley +1 more source
Hyperbolic intersection graphs and (quasi)-polynomial time
We study unit ball graphs (and, more generally, so-called noisy uniform ball graphs) in $d$-dimensional hyperbolic space, which we denote by $\mathbb{H}^d$.
Kisfaludi-Bak, Sándor
core +1 more source