Results 81 to 90 of about 2,644,664 (312)
Independent Complementary Distance Pattern Uniform Graphs [PDF]
A graph G =(V,E) is called to be Smarandachely uniform k-graph for an integer k ≥ 1ifthereexistsM1,M2, ·· ·,Mk ⊂ V (G) such that fMi (u) ={d(u, v):v ∈ Mi} for ∀u ∈ V (G)−Mi is independent of the choice of u ∈ V (G)−Mi and integer i, 1 ≤ i ≤ k.
Koshy, Beena +3 more
core +1 more source
ABSTRACT Introduction Patients requiring long‐term continuous renal replacement therapy (CRRT) generally have poor prognoses. This study evaluated whether adding continuous intravenous sodium infusion (cIVNa) is associated with improved hemodynamics and outcomes in patients undergoing long‐term CRRT for ≥ 7 days.
Akinori Yamaguchi +6 more
wiley +1 more source
Finding a Strong Stable Set or a Meyniel Obstruction in any Graph [PDF]
A strong stable set in a graph $G$ is a stable set that contains a vertex of every maximal clique of $G$. A Meyniel obstruction is an odd circuit with at least five vertices and at most one chord.
Kathie Cameron, Jack Edmonds
doaj +1 more source
OSL detectors were used for dose measurement in a solid water phantom. Two other detectors, Cobia Flex (RTI Electronics) and PTW-Diados were also used to verify the measurements.
Zafar Sajjad +4 more
core +1 more source
Enteropathogenic E. coli (EPEC) infects the human intestinal epithelium, resulting in severe illness and diarrhoea. In this study, we compared the infection of cancer‐derived cell lines with human organoid‐derived models of the small intestine. We observed a delayed in attachment, inflammation and cell death on primary cells, indicating that host ...
Mastura Neyazi +5 more
wiley +1 more source
Layered Graphs: Applications and Algorithms
The computation of distances between strings has applications in molecular biology, music theory and pattern recognition. One such measure, called short reversal distance, has applications in evolutionary distance computation. It has been shown that this
Bhadrachalam Chitturi +3 more
doaj +1 more source
Solving Robust Variants of the Maximum Weighted Independent Set Problem on Trees
This paper deals with the maximum weighted independent set (MWIS) problem. We consider several robust variants of the MWIS problem on trees and prove that most of them are NP-hard.
Ana Klobučar, Robert Manger
doaj +1 more source
Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete [PDF]
A graph is unfrozen with respect to k independent set if it has an independent set of size k after the addition of any edge. The problem of recognizing such graphs is known to be NP-complete.
Nesrine Abbas +2 more
doaj +1 more source
A Generalization of maximal independent sets
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arun K. Jagota +2 more
openaire +1 more source
Reciprocal control of viral infection and phosphoinositide dynamics
Phosphoinositides, although scarce, regulate key cellular processes, including membrane dynamics and signaling. Viruses exploit these lipids to support their entry, replication, assembly, and egress. The central role of phosphoinositides in infection highlights phosphoinositide metabolism as a promising antiviral target.
Marie Déborah Bancilhon, Bruno Mesmin
wiley +1 more source

