Results 111 to 120 of about 983,866 (300)
Small Maximal Independent Sets and Faster Exact Graph Coloring
Journal of Graph Algorithms and Applications, 2003 We show that, for any n-vertex graph G and integer parameter k, there are at most 34k−n 4n−3k maximal independent sets I ⊂ G with |I| ≤ k, and that all such sets can be listed in time O(34k−n 4n−3k). These bounds are tight when n/4 ≤ k ≤ n/3.
David Eppstein
doaj +1 more source
Problems on One Way Road Networks
Journal of Graph Algorithms and Applications, 2020 A One-Way Road Network is an ordered pair $OWRN = (W_x,W_y)$ comprising of a set $W_x$ of $m$ directed horizontal roads along with another set $W_y$ of $n$ directed vertical roads.
Jammigumpula Ajay +5 more
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Neuroblastoma's complex, heterogeneous biology poses significant diagnostic and therapeutic challenges, often requiring caregivers to absorb complex information and participate in time‐sensitive decisions. However, caregivers often feel unprepared to evaluate options.
Vickie Buenger +8 more
wiley +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background General pediatricians often evaluate hematologic and oncologic presentations before subspecialty consultation, yet the 2025 Accreditation Council for Graduate Medical Education (ACGME) pediatric requirements reduce inpatient pediatric hematology/oncology (PHO) time, raising questions about resident readiness.
Colburn Yu, Rohini Jain
wiley +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Pediatric cancer remains a leading cause of morbidity and mortality worldwide, particularly in low‐and middle‐income countries. Cancer treatment may impair nutritional status, alter body composition, and exacerbate cancer‐related fatigue (CRF).
Luís Carlos Lopes‐Junior +11 more
wiley +1 more source
On the number of maximum independent sets of graphs [PDF]
Transactions on Combinatorics, 2014 Let $G$ be a simple graph. An independent set is a set of pairwise non-adjacent vertices. The number of vertices in a maximum independent set of $G$ is denoted by $alpha(G)$. In this paper, we characterize graphs $G$ with $n$ vertices and with maximum
Tajedin Derikvand, Mohammad Reza Oboudi
doaj
Generalized independent families and dense sets of Box-Product spaces
Applied General Topology, 2006 A generalization of independent families on a set S is introduced, based on which various topologies on S can be defined. In fact, the set S with any such topology is homeomorphic to a dense subset of the corresponding box product space (Theorem 2.2 ...
Wanjun Hu
doaj +1 more source
On the Maximal Independent Sets of k-mers with the Edit Distance. [PDF]
ACM BCB, 2023 Ma L, Chen K, Shao M.
europepmc +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT The International Paediatric Oncology Society Global Mapping Programme aims to collect data on global paediatric oncology services by continent, with Africa and Latin America completed. This study reports on the methodology and lessons learned for Oceania, a unique continent with resource disparity across countries, multiple small island ...
Trisha Soosay Raj +16 more
wiley +1 more source
Robust maximum weighted independent-set problems on interval graphs. [PDF]
We study the maximum weighted independent-set problem on interval graphs with uncertainty on the vertex weights. We use the absolute robustness criterion and the min-max regret criterion to evaluate solutions.
Leus, Roel, Talla Nobibon, Fabrice
core