Results 61 to 70 of about 8,249,666 (288)
A novel evolutionary formulation of the maximum independent set problem
, 2003 We introduce a novel evolutionary formulation of the problem of finding a maximum independent set of a graph. The new formulation is based on the relationship that exists between a graph's independence number and its acyclic orientations.
Barbosa, V. C., Campos, L. C. D.
core +2 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Arteriovenous malformations (AVMs) are rare, high‐flow, vascular anomalies that can occur either sporadically or as part of a genetic syndrome. AVMs can progress with serious morbidity and even mortality if left unchecked. Sirolimus is an mTOR inhibitor that is effective in low‐flow vascular malformations; however, its role in AVMs is unclear.
Will Swansson +3 more
wiley +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Purpose Although not always achieved, complete chemotherapy‐induced nausea and vomiting (CINV) control is the conventional goal of CINV prophylaxis. In this two‐center, mixed‐methods study, we sought to understand the preferences of adolescent patients and family caregivers for CINV control endpoints.
Haley Newman +8 more
wiley +1 more source
Some Results on the Independence Polynomial of Unicyclic Graphs
Discussiones Mathematicae Graph Theory, 2018 Let G be a simple graph on n vertices. An independent set in a graph is a set of pairwise non-adjacent vertices. The independence polynomial of G is the polynomial I(G,x)=∑k=0ns(G,k)xk$I(G,x) = \sum\nolimits_{k = 0}^n {s\left({G,k} \right)x^k }$, where s(
Oboudi Mohammad Reza
doaj +1 more source
Fast algorithms for min independent dominating set
, 2009 We first devise a branching algorithm that computes a minimum independent dominating set on any graph with running time O*(2^0.424n) and polynomial space. This improves the O*(2^0.441n) result by (S. Gaspers and M. Liedloff, A branch-and-reduce algorithm
D.S. Johnson +9 more
core +2 more sources
Families of k-independent sets
Discrete Mathematics, 1973 AbstractA collection F of sets is k-independent if for any selections A, B of k1 and k2 of its members with k1+k2=k, there are elements in all the members of A and not in the members of B. Bounds on the maximal size of k-independent families exponential in the total number of elements are obtained.
Kleitman, Daniel J., Spencer, Joel
openaire +1 more source
INDEPENDENT SETS FROM AN ALGEBRAIC PERSPECTIVE [PDF]
International Journal of Algebra and Computation, 2012 In this paper, we study the basic problem of counting independent sets in a graph and, in particular, the problem of counting antichains in a finite poset, from an algebraic perspective. We show that neither independence polynomials of bipartite Cohen–Macaulay graphs nor Hilbert series of initial ideals of radical zero-dimensional complete ...
Dickenstein, Alicia Marcela +1 more
openaire +3 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Nurses are central to cancer care for children and adolescents, yet no comprehensive synthesis has defined essential core competencies for pediatric oncology nursing (PON) practice internationally, particularly in Latin America and the Caribbean (LAC).
Luís Carlos Lopes‐Júnior +7 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
Online Dominating Set and Independent Set
, 2021 26 pages, 17 ...
De, Minati +2 more
openaire +2 more sources