Results 61 to 70 of about 10,268,798 (293)
Quantum-informed reduction algorithm for the maximum independent set problem
We propose and implement a quantum-informed reduction algorithm for the maximum independent set problem that integrates classical kernelization techniques with information extracted from quantum devices.
Martin J. A. Schuetz +10 more
doaj +1 more source
ABSTRACT Rates of cancer among adolescents and young adults (AYA), age 15–39 years, are increasing. Consequently, radiation oncologists are treating more AYAs who have diagnoses spanning both pediatric and adult practices. Compared to pediatric and older adult patients, AYAs face a unique set of challenges.
Hesham Elhalawani +7 more
wiley +1 more source
Improved Distributed Approximations for Maximum Independent Set
We present improved results for approximating maximum-weight independent set ($\MaxIS$) in the CONGEST and LOCAL models of distributed computing. Given an input graph, let $n$ and $Δ$ be the number of nodes and maximum degree, respectively, and let $\MIS(n,Δ)$ be the the running time of finding a \emph{maximal} independent set ($\MIS$) in the CONGEST ...
Kawarabayashi, Ken-ichi +3 more
openaire +5 more sources
Analisis dan Implementasi Algoritma Finding Maximum Independent Set (FMIS) Untuk Mencari Maximum Independent Set Pada Graf [PDF]
ABSTRAKSI: Pencarian Maximum Independent Set (MIS) pada sebuah graf adalah salah satu permasalahan NP-Complete. Maximum Independent Set (MIS) pada sebuah graf memiliki penerapan yang penting dan diperlukan algoritma yang tepat untuk mencarinya ...
Arifin Suhendar
core
ABSTRACT Background Survivors of pediatric brain tumors (PBTs) can experience long‐term social difficulties, impacting quality of life. Beyond medical and environmental factors, family psychosocial risk may play a role in social outcomes by shaping the caregiving environment and may provide intervention options.
Renske H. Houben +4 more
wiley +1 more source
Maximum independent sets in subcubic graphs: New results [PDF]
The maximum independent set problem is known to be NP-hard in the class of subcubic graphs, i.e. graphs of vertex degree at most 3. We present a polynomial-time solution in a subclass of subcubic graphs generalizing several previously known results.
Ararat Harutyunyan +3 more
openaire +6 more sources
ABSTRACT Background Patients with chronic kidney disease undergoing hemodialysis commonly experience reduced physical function, fatigue, poor sleep quality, and impaired health‐related quality of life. Intradialytic exercise has been proposed as a non‐pharmacological strategy to improve these outcomes.
Klebson da Silva Almeida +6 more
wiley +1 more source
On the k-Component Independence Number of a Tree
Let G be a graph and k≥1 be an integer. A subset S of vertices in a graph G is called a k-component independent set of G if each component of GS has order at most k.
Shuting Cheng, Baoyindureng Wu
doaj +1 more source
Enteropathogenic E. coli (EPEC) infects the human intestinal epithelium, resulting in severe illness and diarrhoea. In this study, we compared the infection of cancer‐derived cell lines with human organoid‐derived models of the small intestine. We observed a delayed in attachment, inflammation and cell death on primary cells, indicating that host ...
Mastura Neyazi +5 more
wiley +1 more source
Structural insights into an engineered feruloyl esterase with improved MHET degrading properties
A feruloyl esterase was engineered to mimic key features of MHETase, enhancing the degradation of PET oligomers. Structural and computational analysis reveal how a point mutation stabilizes the active site and reshapes the binding cleft, expading substrate scope.
Panagiota Karampa +5 more
wiley +1 more source

