Results 101 to 110 of about 227,714 (275)
Efficient Maintenance of Minimum Spanning Trees in Dynamic Weighted Undirected Graphs
This paper presents an algorithm for effectively maintaining the minimum spanning tree in dynamic weighted undirected graphs. The algorithm efficiently updates the minimum spanning tree when the underlying graph structure changes.
Mao Luo+5 more
doaj +1 more source
Walnut seeds are enclosed in a remarkably strong shell made of sclerenchyma, separated by a pectin‐rich suture tissue. Different cell shapes and chemical composition of this tissue point to an opening mechanism, which is triggered by cyclic humidity changes.
Sebastian J. Antreich+3 more
wiley +1 more source
Polynomial-Time Space-Optimal Silent Self-Stabilizing Minimum-Degree Spanning Tree Construction [PDF]
Motivated by applications to sensor networks, as well as to many other areas, this paper studies the construction of minimum-degree spanning trees. We consider the classical node-register state model, with a weakly fair scheduler, and we present a space ...
Blin, Lélia, Fraigniaud, Pierre
core
This study reveals how vorticity—a swirling flow pattern—enhances platelet aggregation and thrombus formation in high‐shear conditions. Using a custom microfluidic model, it is shows that vorticity promotes vWF–GPIbα interactions and calcium signaling, providing new insights into thrombosis mechanobiology and informing safer blood‐contacting medical ...
Jianfang Ren+13 more
wiley +1 more source
Convergence drawing is used to create flexible, microscale, multifunctional fiber‐based neural probes. Optimized materials selection enables individual devices to perform neural recording, electrical stimulation, optogenetics, fiber photometry, fluid delivery, and voltammetric neurotransmitter detection in rodents.
Nicolette Driscoll+16 more
wiley +1 more source
Some NP-complete edge packing and partitioning problems in planar graphs [PDF]
Graph packing and partitioning problems have been studied in many contexts, including from the algorithmic complexity perspective. Consider the packing problem of determining whether a graph contains a spanning tree and a cycle that do not share edges ...
Yang, Jed
core
Spanning tree generating functions and Mahler measures
We define the notion of a spanning tree generating function (STGF) $\sum a_n z^n$, which gives the spanning tree constant when evaluated at $z=1,$ and gives the lattice Green function (LGF) when differentiated.
Anthony J Guttmann+28 more
core +1 more source
High‐Resolution Patterned Delivery of Chemical Signals From 3D‐Printed Picoliter Droplet Networks
3D‐printed picoliter droplet networks have been fabricated that control gene expression in bacterial populations by releasing chemical signals with precise spatial definition and high temporal resolution. This system of effector release is widely applicable, offering diverse applications in biology and medicine.
Jorin Riexinger+7 more
wiley +1 more source
A generalization of heterochromatic graphs
In 2006, Suzuki, and Akbari & Alipour independently presented a necessary and sufficient condition for edge-colored graphs to have a heterochromatic spanning tree, where a heterochromatic spanning tree is a spanning tree whose edges have distinct colors.
G. Hahn+7 more
core +1 more source
This article summarizes significant technological advancements in materials, photonic devices, and bio‐interfaced systems, which demonstrate successful applications for impacting human healthcare via improved therapies, advanced diagnostics, and on‐skin health monitoring.
Seunghyeb Ban+5 more
wiley +1 more source