Results 61 to 70 of about 2,369,458 (297)
Pediatric Blood &Cancer, EarlyView.ABSTRACT Ongoing evidence indicates increased risk of sarcopenic obesity among children and young people (CYP) with acute lymphoblastic leukemia (ALL), often beginning early in treatment, persisting into survivorship. This review evaluates current literature on body composition in CYP with ALL during and after treatment.
Lina A. Zahed +5 more
wiley +1 more source
An unconstrained binary quadratic programming for the maximum independent set problem
Nonlinear 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
Finding a Strong Stable Set or a Meyniel Obstruction in any Graph [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 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
Pediatric Blood &Cancer, EarlyView.ABSTRACT Objectives To identify predictors of chronic ITP (cITP) and to develop a model based on several machine learning (ML) methods to estimate the individual risk of chronicity at the timepoint of diagnosis. Methods We analyzed a longitudinal cohort of 944 children enrolled in the Intercontinental Cooperative immune thrombocytopenia (ITP) Study ...
Severin Kasser +6 more
wiley +1 more source
On equality in an upper bound for the acyclic domination number [PDF]
Opuscula Mathematica, 2008 A subset \(A\) of vertices in a graph \(G\) is acyclic if the subgraph it induces contains no cycles. The acyclic domination number \(\gamma_a(G)\) of a graph \(G\) is the minimum cardinality of an acyclic dominating set of \(G\).
Vladimir Samodivkin
doaj
Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 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
Pediatric Blood &Cancer, EarlyView.ABSTRACT Surveillance imaging aims to detect tumour relapse before symptoms develop, but it's unclear whether earlier detection of relapse leads to better outcomes in children and young people (CYP) with medulloblastoma and ependymoma. This systematic review aims to identify relevant literature to determine the efficacy of surveillance magnetic ...
Lucy Shepherd +3 more
wiley +1 more source
Layered Graphs: Applications and Algorithms
Algorithms, 2018 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
Extremal Colorings and Independent Sets
Graphs and Combinatorics, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Engbers, John, Erey, Aysel
openaire +2 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Despite their increased risk for functional impairment resulting from cancer and its treatments, few adolescents and young adults (AYAs) with a hematological malignancy receive the recommended or therapeutic dose of exercise per week during inpatient hospitalizations.
Jennifer A. Kelleher +8 more
wiley +1 more source