Results 81 to 90 of about 13,294,177 (308)
Personalized Zebrafish Models for Fusion‐Positive Pediatric Sarcomas
Pediatric Blood &Cancer, EarlyView.ABSTRACT Clinical sequencing efforts have revolutionized our approaches to categorizing pediatric cancers in real time. This has dramatically improved our ability to profile pediatric tumors, identify actionable vulnerabilities, and influence clinical care.
Lisa H. Hall +2 more
wiley +1 more source
On Approximating Maximum Independent Set of Rectangles [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2016 We study the Maximum Independent Set of Rectangles (MISR) problem: given a set of n axis-parallel rectangles, find a largest-cardinality subset of the rectangles, such that no two of them overlap.
Julia Chuzhoy, Alina Ene
semanticscholar +1 more source
European Journal of Combinatorics, 2014 Yannakakis' Clique versus Independent Set problem (CL-IS) in communication complexity asks for the minimum number of cuts separating cliques from stable sets in a graph, called CS-separator. Yannakakis provides a quasi-polynomial CS-separator, i.e. of size $O(n^{\log n})$, and addresses the problem of finding a polynomial CS-separator. This question is
Bousquet, Nicolas +2 more
openaire +3 more sources
Health Literacy, Self‐Efficacy and Knowledge of Sickle Cell Disease Among Caregivers
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Sickle cell disease (SCD) is a hereditary blood disorder in which abnormal haemoglobin leads to severe anaemia, painful crises and organ failure. Caregivers’ health literacy (HL) – their ability to assess, understand and apply information, and interact with healthcare professionals – is crucial for managing children with SCD, yet ...
Melanie Bruinooge +6 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
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
Remarks on Dynamic Monopolies with Given Average Thresholds
Discussiones Mathematicae Graph Theory, 2015 Dynamic monopolies in graphs have been studied as a model for spreading processes within networks. Together with their dual notion, the generalized degenerate sets, they form the immediate generalization of the classical notions of vertex covers and ...
Centeno Carmen C., Rautenbach Dieter
doaj +1 more source
Extremal Colorings and Independent Sets
Graphs and Combinatorics, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
John Engbers, Aysel Erey
openaire +2 more sources
Early Impact of Childhood Opportunity on Neurocognitive Outcomes in Sickle Cell Disease
Pediatric Blood &Cancer, EarlyView.ABSTRACT Introduction Neurocognitive impairment is a well‐recognized complication of sickle cell disease (SCD) that begins early in childhood and persists across development. While cerebrovascular injury contributes substantially to risk, neurocognitive deficits are also observed in children without overt or silent cerebral infarctions, suggesting ...
Julia E. LaMotte +5 more
wiley +1 more source
The ramsey number for theta graph versus a clique of order three and four
Discussiones Mathematicae Graph Theory, 2014 For any two graphs F1 and F2, the graph Ramsey number r(F1, F2) is the smallest positive integer N with the property that every graph on at least N vertices contains F1 or its complement contains F2 as a subgraph.
Bataineh M.S.A. +2 more
doaj +1 more source