Results 71 to 80 of about 2,644,664 (312)
On-line computation and maximum-weighted hereditary subgraph problems [PDF]
In this paper1 we study the on-line version of maximum-weighted hereditary subgraph problems. In our on-line model, the final instance (a graph with n vertices) is revealed in t clusters, 2 ≤ t ≤ n .
Demange Marc +2 more
doaj +1 more source
Dietary Protein Intake and Peritoneal Protein Losses in Peritoneal Dialysis Patients
ABSTRACT Introduction Peritoneal dialysis (PD) patients lose protein in their waste dialysate, potentially increasing their risk for malnutrition. We wished to determine whether there was any association between losses and dietary protein intake (DPI). Methods DPI was assessed from 24‐h dietary recall using Nutrics software.
Haalah Shaaker, Andrew Davenport
wiley +1 more source
Exploiting Interference for Capacity Improvement in Software-Defined Vehicular Networks
Vehicular ad hoc networks (VANETs), which are deployed along roads, make traffic systems safer and more efficient. The existing theoretical results on capacity scaling laws provide insights and guidance for designing and deploying VANETs.
Xin Guan +5 more
doaj +1 more source
Independent 2-point set domination in graphs - II
A set D of vertices in a connected graph G is said to be an independent 2-point set dominating set (or in short i-2psd set) of G if D is an independent set and for every non-empty subset [Formula: see text] there exists a non-empty subset [Formula: see ...
Deepti Jain, Purnima Gupta
doaj +1 more source
Extremal Colorings and Independent Sets
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
John Engbers, Aysel Erey
openaire +2 more sources
ABSTRACT Background Therapeutic apheresis (TA) is an established treatment modality for hematologic, neurologic, and immunologic disorders, yet access remains severely limited in sub‐Saharan Africa. Donor apheresis, including platelet apheresis collection from healthy donors, represents an important complementary modality supporting blood product ...
Nosa Bazuaye +33 more
wiley +1 more source
On the existence of independent (1,k)-dominating sets for k\in\{1,2\} in two products of graphs [PDF]
A subset \(J\) of vertices is said to be a \((1,k)\)-dominating set if every vertex \(v\) not belonging to the set \(J\) has a neighbour in \(J\) and there exists also another vertex in \(J\) within the distance at most \(k\) from \(v\).
Paweł Bednarz +2 more
doaj +1 more source
Stable sets versus independent sets
The matroidal number \(m(G)\) of a graph \(G\) is defined as the smallest integer \(m\) so that the collection of the stable sets of \(G\) arises as \(I_ 1\cup I_ 2 \cup \cdots \cup I_ m\) where the \(I_ i\) are collections of independent sets of matroids on the vertex set of \(G\).
openaire +2 more sources
A Note on Independent Sets in Trees [PDF]
We give a simple graph-theoretical proof that the largest number of maximal independent vertex sets in a tree with n vertices is given by \[ m(T) = \begin{cases} 2^{k-1}+1 & \text{if \(n=2k,\)} \\ 2^ k & \text{if \(n=2k+1,\)} \end{cases} \] a result first proved by \textit{H. Wilf} [SIAM J. Algebraic Discrete Methods 7, 125-130 (1986; Zbl 0584.05024)].
openaire +2 more sources
Independent expert valuation/appraising of intellectual property rights objects, such as brands and goodwill, performed by the Costs approach, is based on economic indicators of these intangible assets utility degree, which are connected with the sum of ...
Zoryana, Skybinska +2 more
core

