Results 101 to 110 of about 13,294,177 (308)
A note on the transmission feasibility problem in networks
In the networking designing phase, the network needs to be built according to certain indicators to ensure that the network has the ideal functions and can work smoothly.
Gao Wei, Zhang Yunqing, Chen Yaojun
doaj +1 more source
Solving Robust Variants of the Maximum Weighted Independent Set Problem on Trees
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]
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
An [Imperfect] Case for Dyadic Research in Pediatric Psychosocial Oncology
Pediatric Blood &Cancer, EarlyView.
Stephanie M. Nanos +2 more
wiley +1 more source
Some Results on the Independence Polynomial of Unicyclic Graphs
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
Matroid Valuation on Independent Sets
Recently \textit{A. W. M. Dress} and \textit{W. Wenzel} [Adv. Math. 93, No. 2, 214-250 (1992; Zbl 0754.05027)] introduced the concept of valuated matroid in terms of a quantitative extension of the basis exchange axiom for matroids. This paper gives two sets of cryptomorphically equivalent axioms of valuated matroids in terms of a function defined on ...
openaire +2 more sources
On the Number of Independent Sets in a Tree [PDF]
We show in a simple way that for any $k,m\in{\Bbb N}$, there exists a tree $T$ such that the number of independent sets of $T$ is congruent to $k$ modulo $m$. This resolves a conjecture of Wagner (Almost all trees have an even number of independent sets, Electron. J. Combin. 16 (2009), # R93).
openaire +2 more sources
ABSTRACT Purpose Despite 5‐year survival rates of over 90% among children and adolescents/young adults (CAYAs) with classic Hodgkin lymphoma (cHL), 15%–20% relapse after frontline therapy. Prior analysis of frontline Children's Oncology Group (COG) clinical trials demonstrated that, despite similar rates of relapse, non‐Hispanic Black (NHB) and ...
Mallorie B. Heneghan +14 more
wiley +1 more source
ABSTRACT Introduction Anthracycline‐related cardiac remodeling precedes heart failure in childhood cancer survivors. The objectives of this study were to determine the relationships between patient‐specific factors, moderate‐to‐vigorous physical activity (MVPA), and cardiac remodeling.
Hari K. Narayan +15 more
wiley +1 more source
Exploiting Interference for Capacity Improvement in Software-Defined Vehicular Networks
Vehicular ad hoc networks (VANETs), which are deployed along roads, make traffic systems safer and more efficient. The existing theoretical results on capacity scaling laws provide insights and guidance for designing and deploying VANETs.
Xin Guan +5 more
doaj +1 more source

