Results 61 to 70 of about 2,421,288 (269)
Clinical Course and Impact of Breaks in Therapy for Children With Relapsed/Refractory Solid Tumors
Pediatric Blood &Cancer, EarlyView.ABSTRACT Introduction Pediatric relapsed or refractory (R/R) solid tumors carry a dismal prognosis, and postrelapse patient experiences are not well described. We present postrelapse outcomes, including number of R/R events and subsequent therapy regimens.
Matthew T. McEvoy +5 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
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Neuropsychological complications may impair the qualitative prognosis of patients with pediatric brain tumors. However, multifaceted evaluations cannot be conducted in all patients because they are time consuming and burdensome for patients.
Ami Tabata +9 more
wiley +1 more source
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
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
Solving Robust Variants of the Maximum Weighted Independent Set Problem on Trees
Mathematics, 2020 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]
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
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
Implementing Health‐Related Quality of Life Assessment in Pediatric Oncology: A Feasibility Study
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background There is growing interest in embedding health‐related quality of life (HRQoL) assessment and patient‐reported outcome measures (PROMs) within clinical cancer care. This study evaluated the feasibility, acceptability, and usability of implementing an electronic PROM (ePROM) platform to measure HRQoL in children with cancer ...
Mikaela Doig +13 more
wiley +1 more source
Domination, Eternal Domination, and Clique Covering
Discussiones Mathematicae Graph Theory, 2015 Eternal and m-eternal domination are concerned with using mobile guards to protect a graph against infinite sequences of attacks at vertices. Eternal domination allows one guard to move per attack, whereas more than one guard may move per attack in the m-
Klostermeyer William F., Mynhardt C.M.
doaj +1 more source