Results 81 to 90 of about 8,249,666 (288)
Finding a Strong Stable Set or a Meyniel Obstruction in any Graph [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A strong stable set in a graph $G$ is a stable set that contains a vertex of every maximal clique of $G$. A Meyniel obstruction is an odd circuit with at least five vertices and at most one chord.
Kathie Cameron, Jack Edmonds
doaj +1 more source
Extremal Colorings and Independent Sets
Graphs and Combinatorics, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Engbers, John, Erey, Aysel
openaire +2 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT End‐of‐life conversations with adolescents and young adults (AYAs) with cancer rarely occur without the guidance of healthcare professionals. As a part of the ‘Difficult Discussions’ study, focused on palliative care and advance care planning discussions with AYAs with cancer, we investigated the factors that healthcare professionals identify ...
Justine Lee +9 more
wiley +1 more source
Layered Graphs: Applications and Algorithms
Algorithms, 2018 The computation of distances between strings has applications in molecular biology, music theory and pattern recognition. One such measure, called short reversal distance, has applications in evolutionary distance computation. It has been shown that this
Bhadrachalam Chitturi +3 more
doaj +1 more source
Solving Robust Variants of the Maximum Weighted Independent Set Problem on Trees
Mathematics, 2020 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]
Discrete Mathematics & Theoretical Computer Science, 2005 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
Defining Roles in Pediatric Palliative Care: Perspectives From Oncology and Palliative Care Teams
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Early integration of pediatric palliative care (PPC) is associated with improved symptom management, quality of life, and healthcare utilization for children with cancer. Despite this, variation persists in how PPC is understood, operationalized, and integrated within pediatric oncology programs. In particular, ambiguity surrounding
Leeat Granek +13 more
wiley +1 more source
Polynomial-time algorithm for Maximum Weight Independent Set on $P_6$-free graphs
, 2019 In the classic Maximum Weight Independent Set problem we are given a graph $G$ with a nonnegative weight function on vertices, and the goal is to find an independent set in $G$ of maximum possible weight.
Grzesik, Andrzej +3 more
core +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT In pediatric patients, T‐cell lymphoblastic lymphoma (T‐LBL) survival exceeds 80%. Relapse remains associated with limited curative options. Frontline treatment is largely extrapolated from T‐cell acute lymphoblastic leukemia (T‐ALL) treatment, reflecting the ongoing debate, whether both entities represent distinct diseases or variants within ...
Marie C. Heider +4 more
wiley +1 more source
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Objective To compare the efficacy and safety of roxarestat versus recombinant human erythropoietin (rhEPO) in the management of renal anemia in patients undergoing maintenance hemodialysis. Methods This was a prospective, open‐label, randomized controlled trial.
Lingling Chen, Junjie Zhu, Qiaonan Ge
wiley +1 more source