Results 71 to 80 of about 80,587 (266)
On a Spanning Tree with Specified Leaves [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yoshimi Egawa +3 more
openaire +2 more sources
Biomimetic Microfractals Based Flexible Triboelectric Nanogenerators
A leaf‐skeleton‐based microfractal architecture is integrated with guided CuNW networks and biomimetic triboelectric polymer layers, enabling breathable, flexible, and material‐efficient triboelectric nanogenerators. The resulting system combines enhanced charge generation and charge transport, offering potential for next‐generation self‐powered ...
Amit Barua +7 more
wiley +1 more source
A systematic review is conducted to assess the influence of electrode architecture across micro‐ to mesoscopic length scales on electron‐transfer pathways in electrocatalysis. We discuss the structure‐activity relationships in electrocatalytic applications, including resource recovery and environmental remediation, and provide cost‐effective, efficient
Manshu Zhao +6 more
wiley +1 more source
An innovative, lightweight 3D‐printed skinfold chamber system is presented for long‐term intravital imaging. This affordable, biocompatible platform simplifies surgical implantation and allows high‐resolution, multimodal visualization of the tumor microenvironment for up to four weeks.
Iván Cortés Domínguez +9 more
wiley +1 more source
Minimum Spanning Tree for the Implementation of Kruskal’s Algorithm
Kruskal’s algorithm is an algorithm used to find a minimum spanning tree in graph connectivity which gives an option to keep processing the edge limit with the least weight.
Paryati Paryati, Ahmad Subhan Yazid
doaj +1 more source
Tomographic Printing in a Chip: A Versatile Platform for Biomimetic 3D Organ‐on‐Chip
A novel light‐based bioprinting approach, TVAM‐in‐a‐chip, enables rapid, contactless fabrication of biomimetic 3D organ‐on‐chip devices directly within preassembled microfluidic platforms. This strategy supports diverse materials, including cell‐laden resins, and eliminates post‐assembly steps.
Riccardo Rizzo +3 more
wiley +1 more source
On the SPANNING k-TREE problem
A \(k\)-tree \(T\) is defined recursively as being either a clique of size \(k\) or having a vertex \(x\) whose neighbourhood is a clique of size \(k\) and such that \(T-x\) is a \(k\)-tree. (Note that \(k\)-trees are not trees, if \(k>1\).) The following SPANNING \(k\)-TREE problem is known to be NP-complete: given a graph \(G\), does \(G\) possess a ...
Leizhen Cai, Frédéric Maffray
openaire +2 more sources
Bioinspired Adaptive Sensors: A Review on Current Developments in Theory and Application
This review comprehensively summarizes the recent progress in the design and fabrication of sensory‐adaptation‐inspired devices and highlights their valuable applications in electronic skin, wearable electronics, and machine vision. The existing challenges and future directions are addressed in aspects such as device performance optimization ...
Guodong Gong +12 more
wiley +1 more source
The Strong Vertex Span of Trees
Abstract The strong vertex (edge) span of a given graph G is the maximum distance that two players can maintain at all times while visiting all vertices (edges) of G and moving either to an adjacent vertex or staying in the current ...
Mateja Grašič +2 more
openaire +3 more sources
Metal‐free carbon catalysts enable the sustainable synthesis of hydrogen peroxide via two‐electron oxygen reduction; however, active site complexity continues to hinder reliable interpretation. This review critiques correlation‐based approaches and highlights the importance of orthogonal experimental designs, standardized catalyst passports ...
Dayu Zhu +3 more
wiley +1 more source

