Results 71 to 80 of about 983,866 (300)
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
Statistical Mechanics of Maximal Independent Sets [PDF]
, 2009 The graph theoretic concept of maximal independent set arises in several practical problems in computer science as well as in game theory. A maximal independent set is defined by the set of occupied nodes that satisfy some packing and covering ...
Dall'Asta, Luca +6 more
core +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
Independent set dominating sets in bipartite graphs [PDF]
Opuscula Mathematica, 2005 The paper continues the study of independent set dominating sets in graphs which was started by E. Sampathkumar. A subset \(D\) of the vertex set \(V(G)\) of a graph \(G\) is called a set dominating set (shortly sd-set) in \(G\), if for each set \(X ...
Bohdan Zelinka
doaj
Independent and monochromatic absorbent sets in infinite digraphs
AKCE International Journal of Graphs and Combinatorics, 2015 Let D be a digraph, we say that it is an m-coloured digraph if the arcs of D are coloured with at most m-colours. An (u,v) arc is symmetrical if (v,u) is also an arc of D. A directed path (resp.
Alejandro Contreras-Balbuena +2 more
doaj +1 more source
Parallel group independent component analysis for massive fMRI data sets. [PDF]
PLoS ONE, 2017 Independent component analysis (ICA) is widely used in the field of functional neuroimaging to decompose data into spatio-temporal patterns of co-activation.
Shaojie Chen +8 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