Results 71 to 80 of about 8,249,666 (288)

Pulmonary Dysfunction Is Associated With Sleep Study Abnormalities in Children With Sickle Cell Disease: A Multicenter Study

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Introduction Pulmonary dysfunction and sleep abnormalities are common in children with sickle cell disease (SCD) and are associated with worse clinical outcomes. Whether spirometry abnormalities are associated with polysomnography (PSG) findings remains unclear.
Ammar Saadoon Alishlash   +4 more
wiley   +1 more source

An unconstrained binary quadratic programming for the maximum independent set problem

open access: yesNonlinear Analysis, 2012
For a given graph G = (V, E) the maximum independent set problem is to find the largest subset of pairwise nonadjacent vertices. We propose a new model which is a reformulation of the maximum independent set problem as an unconstrained quadratic binary ...
Sidi Mohamed Douiri, Souad Elbernoussi
doaj  

On-line computation and maximum-weighted hereditary subgraph problems [PDF]

open access: yesYugoslav Journal of Operations Research, 2011
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

Complexity of the robust weighted independent set problems on interval graphs

open access: yes, 2014
This paper deals with the max-min and min-max regret versions of the maximum weighted independent set problem on interval graphswith uncertain vertex weights.
Kasperski, Adam, Zielinski, Pawel
core   +1 more source

Prevalence and Trajectory of Household Material Hardship Among Children With Advanced Cancer

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background/Objectives Families of children with advanced cancer living in poverty experience inferior outcomes including poor parent mental health and worse child quality of life. Household material hardship (HMH: food, housing, transportation, and/or utility insecurity) is a modifiable poverty exposure—and potential intervention target—that ...
Sarah Wright   +13 more
wiley   +1 more source

Exploiting Interference for Capacity Improvement in Software-Defined Vehicular Networks

open access: yesIEEE Access, 2017
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

open access: yesAKCE International Journal of Graphs and Combinatorics, 2022
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

Inpatient Food Insecurity and Pediatric Hematology Oncology Hospitalization Outcomes

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Children with cancer and blood disorders are at risk for food insecurity (FI). We aimed to describe the association of inpatient food insecurity (IFI) and hospitalization outcomes among patients admitted to the pediatric hematology oncology service. Of 325 caregivers screened for IFI, 60 (18.6%) screened positive.
Joanna M. Robles   +4 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]

open access: yesOpuscula Mathematica
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

Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods

open access: yes, 2013
We investigate online algorithms for maximum (weight) independent set on graph classes with bounded inductive independence number like, e.g., interval and disk graphs with applications to, e.g., task scheduling and spectrum allocation.
E.B. Dynkin   +9 more
core   +1 more source

Home - About - Disclaimer - Privacy