Results 91 to 100 of about 13,294,177 (308)
On-line computation and maximum-weighted hereditary subgraph problems [PDF]
Yugoslav 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
A Note on Independent Sets in Trees [PDF]
SIAM Journal on Discrete Mathematics, 1988 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
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Pediatric bone sarcoma patients and survivors may experience psychosocial challenges related to childhood cancer after their intensive, body‐altering treatment. This cross‐sectional study aimed to evaluate generic and survivor‐specific psychosocial outcomes in a national cohort of pediatric bone sarcoma patients and survivors, and ...
Hinke van der Hoek +14 more
wiley +1 more source
A simple parallel algorithm for the maximal independent set problem
Symposium on the Theory of Computing, 1985 Simple parallel algorithms for the maximal independent set (MIS) problem are presented. The first algorithm is a Monte Carlo algorithm with a very local property.
Michael Luby
semanticscholar +1 more source
Stable sets versus independent sets
Discrete Mathematics, 1993 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
Re‐Irradiation in Pediatric Diffuse Midline Glioma: A Multi‐Institutional Retrospective Study
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Children with recurrent diffuse midline gliomas (DMGs) have limited therapeutic options at recurrence. Re‐irradiation (RT2) may be used at progression, but with uncertainty about the benefit. Methods We conducted a multi‐institutional retrospective study of children aged < 18 with DMG treated at three centers (Toronto, Canada ...
Ajay Thomas Alex +13 more
wiley +1 more source
A Generalization of maximal independent sets
Discrete Applied Mathematics, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arun K. Jagota +2 more
openaire +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Objectives The association between exposure to dinutuximab beta (DB) and event‐free survival (EFS) or overall survival (OS) of neuroblastoma patients was assessed using data collected during three clinical trials (five cohorts). Methods A systematic review (March 2026) was conducted to identify relevant studies (prospective; registered DB ...
Przemysław Holko +19 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
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Medication nonadherence during the first 100 days after pediatric hematopoietic stem cell transplantation (HSCT) and during oncology treatment increases risk for complications. BMT4me is a caregiver‐facing mobile health (mHealth) application providing medication reminders, symptom tracking, and note‐taking features to support ...
Micah A. Skeens +4 more
wiley +1 more source