Results 91 to 100 of about 488,070 (310)
Chemical Reaction Optimization for Minimum Weight Dominating Set
Applied Computational Intelligence and Soft Computing, 2023 Dominating set of a graph can be defined as the set of vertices that can cover all other vertices of the graph. The minimum weight dominating set (MWDS) is the minimum number of vertices in the dominating set with minimum total weight.
A. Pritam Khan Boni +1 more
doaj +1 more source
2-edge dominating sets and 2- edge domination polynomials of lollipop (L3,m) [PDF]
, 2022 K. Lal Gipson, Arun Williams S.
openalex +1 more source
PICALM::MLLT10 translocated leukemia
FEBS Letters, EarlyView.This comprehensive review of PICALM::MLLT10 translocated acute leukemia provides an in‐depth review of the structure and function of CALM, AF10, and the fusion oncoprotein (1). The multifaceted molecular mechanisms of oncogenesis, including nucleocytoplasmic shuttling (2), epigenetic modifications (3), and disruption of endocytosis (4), are then ...
John M. Cullen +7 more
wiley +1 more source
Independent point-set dominating sets in graphs
AKCE International Journal of Graphs and Combinatorics, 2020 In this paper, we study graphs which possess an independent point-set dominating set (in short, ipsd-set). We call such a graph as an ipsd-graph. We first provide general structural characterization of separable ipsd-graphs and thereafter, in our quest ...
Purnima Gupta, Alka Goyal, Ranjana Jain
doaj +1 more source
β‐TrCP overexpression enhances cisplatin sensitivity by depleting BRCA1
Molecular Oncology, EarlyView.Low levels of β‐TrCP (Panel A) allow the accumulation of BRCA1 and CtIP, which facilitate the repair of cisplatin‐induced DNA damage via homologous recombination (HR) and promote tumor cell survival. In contrast, high β‐TrCP expression (Panel B) leads to BRCA1 and CtIP degradation, impairing HR repair, resulting in persistent DNA damage and apoptosis ...
Rocío Jiménez‐Guerrero +8 more
wiley +1 more source
On global location-domination in graphs [PDF]
, 2013 A dominating set $S$ of a graph $G$ is called locating-dominating, LD-set for short, if every vertex $v$ not in $S$ is uniquely determined by the set of neighbors of $v$ belonging to $S$.
Hernando, C., Mora, M., Pelayo, I. M.
core +1 more source
Dominating Scale-Free Networks Using Generalized Probabilistic Methods
, 2014 We study ensemble-based graph-theoretical methods aiming to approximate the size of the minimum dominating set (MDS) in scale-free networks. We analyze both analytical upper bounds of dominating sets and numerical realizations for applications.
Czabarka, É. +5 more
core +1 more source
Image Segmentation by Dominant Sets
Electronic Notes in Discrete Mathematics, 2003 Abstract We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitive concept of a cluster and that of a dominant set of vertices, a novel notion that generalizes that of a maximal complete subgraph to edge-weighted graphs.
PAVAN M, PELILLO, Marcello
openaire +2 more sources
Bridging the gap: Multi‐stakeholder perspectives of molecular diagnostics in oncology
Molecular Oncology, EarlyView.Although molecular diagnostics is transforming cancer care, implementing novel technologies remains challenging. This study identifies unmet needs and technology requirements through a two‐step stakeholder involvement. Liquid biopsies for monitoring applications and predictive biomarker testing emerge as key unmet needs. Technology requirements vary by
Jorine Arnouts +8 more
wiley +1 more source
Tropical Dominating Sets in Vertex-Coloured Graphs
, 2016 Given a vertex-coloured graph, a dominating set is said to be tropical if every colour of the graph appears at least once in the set. Here, we study minimum tropical dominating sets from structural and algorithmic points of view. First, we prove that the
A Li +12 more
core +1 more source