Results 81 to 90 of about 166,020 (278)
Towards optimal kernel for connected vertex cover in planar graphs [PDF]
We study the parameterized complexity of the connected version of the vertex cover problem, where the solution set has to induce a connected subgraph. Although this problem does not admit a polynomial kernel for general graphs (unless NP is a subset of ...
Kowalik, Lukasz +2 more
core
Sweetosomes, a new class of fucose‐decorated liposomes, are developed via a one‐step microfluidic process without surface chemistry. This study elucidates their main caveolae‐mediated entry and distinct endosomal trafficking. These nanostructures demonstrate superior endosomal escape, organelle acidity modulation, and prolonged plasma persistence ...
Mattia Tiboni +13 more
wiley +1 more source
This study demonstrates that ALY688, a drug mimicking the heart‐protective hormone adiponectin, reduces myocardial ischemia injury. ALY688 increases the production of extracellular vesicles, which carry protective cargo including adiponectin itself.
Jialing Tang +13 more
wiley +1 more source
On A Class of Vertex Cover Ideals
Abstract We investigate vertex cover ideals associated to a significative class of connected graphs. These ideals are stated to be Cohen-Macaulay and, using the notion of linear quotients, standard algebraic invariants for them are computed.
IMBESI, Maurizio, LA BARBIERA, MONICA
openaire +3 more sources
Fine-grained Meta-Theorems for Vertex Integrity [PDF]
Vertex Integrity is a graph measure which sits squarely between two more well-studied notions, namely vertex cover and tree-depth, and that has recently gained attention as a structural graph parameter.
Michael Lampis, Valia Mitsou
doaj +1 more source
Respiratory Organ‐on‐a‐Chip for Disease Modeling: From Architecture to Functional Integration
Respiratory organ‐on‐a‐chip (ROC) models capture key mechanical and cellular cues of the human respiratory system, enabling quantitative dissection of disease mechanisms. This review links ROC architectures to disease modeling, functional integration, and commercialization, and proposes a decision framework that aligns model complexity with mechanistic
Jinzhuo Hu +4 more
wiley +1 more source
Minimum Vertex Cover in Rectangle Graphs [PDF]
We consider the Vertex Cover problem in intersection graphs of axis-parallel rectangles on the plane. We present two algorithms: The first is an EPTAS for non-crossing rectangle families, rectangle families $\calR$ where $R_1 \setminus R_2$ is connected for every pair of rectangles $R_1,R_2 \in \calR$.
Reuven Bar-Yehuda +2 more
openaire +5 more sources
Long‐Term Hydrophilic, Anti‐Clotting, and Anti‐Fibrotic Dynamic Covalent Silicone‐Based Biomaterials
Dynamic covalent crosslinking of a Schiff‐base silicone elastomer with hydrazide‐functionalized polymers is demonstrated to improve the long‐term hydrophilicity as well as the anti‐fouling and anti‐clotting properties of PDMS implants. The hydrazone‐functionalized material prevents hydrophobic recovery, resists clotting, and significantly reduces ...
Norma A. Garza Flores +12 more
wiley +1 more source
A New and Fast Approximation Algorithm for Vertex Cover Using a Maximum Independent Set (VCUMI)
The importance of non-deterministic polynomial (NP) problems in real world scenarios has compelled researchers to consider simple ways of finding approximate solutions to these problems in polynomial time.
Imran Khan, Naveed Riaz
doaj
Computational complexity of the police officer patrol problem on weighted digraphs
A vertex cover of a graph is a set of vertices that includes at least one endpoint of every edge of the graph and can be regarded as the placement of police officers or fixed surveillance cameras so that each street of a neighborhood represented by the ...
Masaki Tomisawa, Hiroaki Tohyama
doaj +1 more source

