Results 61 to 70 of about 140,549 (266)
Layers and Matroids for the Traveling Salesman's Paths
, 2017 Gottschalk and Vygen proved that every solution of the subtour elimination linear program for traveling salesman paths is a convex combination of more and more restrictive "generalized Gao-trees".
Schalekamp, Frans +3 more
core +3 more sources
From Lab to Landscape: Environmental Biohybrid Robotics for Ecological Futures
Advanced Robotics Research, EarlyView.This Perspective explores environmental biohybrid robotics, integrating living tissues, microorganisms, and insects for operation in real‐world ecosystems. It traces the leap from laboratory experiments to forests, wetlands, and urban environments and discusses key challenges, development pathways, and opportunities for ecological monitoring and ...
Miriam Filippi
wiley +1 more source
Edge-independent spanning trees in augmented cubes
Theoretical Computer Science, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Y., Shen, H., Fan, J.
openaire +2 more sources
Strategic Design of Soft Actuators in Translational Medical Robotics for Human‐Centered Healthcare
Advanced Robotics Research, EarlyView.Soft robotics enables biocompatible, compliant medical devices, but clinical translation requires design‐driven engineering beyond materials. This perspective reviews implantable, surgical, and wearable systems by actuation mechanism, highlighting how optimized architectures and integration improve mechanical interfacing, adaptability, and durability ...
Ho Jun Jin +3 more
wiley +1 more source
A Local Algorithm for the Sparse Spanning Graph Problem [PDF]
, 2017 Constructing a sparse spanning subgraph is a fundamental primitive in graph theory. In this paper, we study this problem in the Centralized Local model, where the goal is to decide whether an edge is part of the spanning subgraph by examining only a ...
Lenzen, Christoph, Levi, Reut
core +1 more source
A $2k$-Vertex Kernel for Maximum Internal Spanning Tree
, 2014 We consider the parameterized version of the maximum internal spanning tree problem, which, given an $n$-vertex graph and a parameter $k$, asks for a spanning tree with at least $k$ internal vertices. Fomin et al. [J. Comput. System Sci., 79:1-6] crafted
D Binkele-Raible +19 more
core +1 more source
Advanced Science, EarlyView.This study performs pan‐viromic profiling of 14,529 samples from 5,710 domestic herbivores across five Chinese provinces, establishing the DhCN‐Virome (1,085,360 viral metagenomes). It reveals species/sample‐specific viromic signatures and cross‐species transmission dynamics, aiding unified disease control.
Yue Sun +19 more
wiley +1 more source
Global estimation of burned area using MODIS active fire observations [PDF]
Atmospheric Chemistry and Physics, 2006 We present a method for estimating monthly burned area globally at 1° spatial resolution using Terra MODIS data and ancillary vegetation cover information.
L. Giglio +4 more
doaj
Advanced Science, EarlyView.Itch‐induced tick removal (IITR): An acquired neuroimmune mechanism, itch‐induced tick removal, develops after repeated tick exposure, mobilizing T cells and macrophages at the tick bite site to trigger a rapid scratching response that facilitates timely tick removal within a critical window that precedes the transmission of many tick‐borne pathogens ...
Johannes S. P. Doehl +27 more
wiley +1 more source