Results 31 to 40 of about 55,028 (193)
Rainbow domination and related problems on strongly chordal graphs
Discrete Applied Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
G. Chang, Bo-Jr Li, Jiaojiao Wu
semanticscholar +3 more sources
On the multipacking number of grid graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 In 2001, Erwin introduced broadcast domination in graphs. It is a variant of classical domination where selected vertices may have different domination powers. The minimum cost of a dominating broadcast in a graph $G$ is denoted $\gamma_b(G)$.
Laurent Beaudou, Richard C. Brewster
doaj +1 more source
A parallel algorithm for computing Steiner trees in strongly chordal graphs
Discrete Applied Mathematics, 1994 We present an efficient parallel algorithm for the computation of a minimum Steiner tree for any strongly chordal graph. The algorithm works in O(log2 n) time and uses a linear number of processors provided a strongly perfect elimination ordering is ...
Dahlhaus, Elias
core +3 more sources
Total Roman domination on the digraphs
Open Mathematics, 2023 Let D=(V,A)D=\left(V,A) be a simple digraph with vertex set VV, arc set AA, and no isolated vertex. A total Roman dominating function (TRDF) of DD is a function h:V→{0,1,2}h:V\to \left\{0,1,2\right\}, which satisfies that each vertex x∈Vx\in V with h(x ...
Zhang Xinhong, Song Xin, Li Ruijuan
doaj +1 more source
Characterizing and computing the structure of clique intersections in strongly chordal graphs
Discrete Applied Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ragnar Nevries, Christian Rosenke
semanticscholar +2 more sources
Complexity of Hamiltonian Cycle Reconfiguration
Algorithms, 2018 The Hamiltonian cycle reconfiguration problem asks, given two Hamiltonian cycles C 0 and C t of a graph G, whether there is a sequence of Hamiltonian cycles C 0 , C 1 , … , C t such that C i can be obtained ...
Asahi Takaoka
doaj +1 more source
An Algorithm for Generating Strongly Chordal Graphs
CoRR, 2018 Strongly chordal graphs are a subclass of chordal graphs. The interest in this subclass stems from the fact that many problems which are NP-complete for chordal graphs are solvable in polynomial time for this subclass. However, we are not aware of any algorithm that can generate instances of this class, often necessary for testing purposes.
Md. Zamilur Rahman +2 more
openaire +2 more sources
Arthritis Care &Research, EarlyView.Objective Frailty occurs prematurely in rheumatoid arthritis (RA) and is associated with poor health outcomes. We compared the performance of four frailty instruments, including a pragmatic alternative measure using chair sit‐to‐stand (STS), and evaluated their abilities to predict poor health outcomes.
Kylie E. Riggles +14 more
wiley +1 more source
Advanced Science, EarlyView.ABSTRACT Liver metastasis is a leading cause of mortality in colorectal cancer (CRC), where the inflammatory tumor microenvironment, specifically neutrophil infiltration, significantly promotes metastatic colonization. This study reveals a pro‐metastatic role for alpha‐1 antitrypsin (A1AT) in CRC liver metastasis via a dual mechanism involving ...
Qian Fei +11 more
wiley +1 more source
Advanced Science, EarlyView.We establish a tBid‐mediated cell ablation system in axolotls, achieve rapid and efficient ablation of multiple cell types, including muscle stem cell, spinal cord cell, and connective tissue (CT) cells. We investigate the role of CT using tBid‐mediated CT ablation and identify its essential role for limb development and regeneration.
Yan Hu +11 more
wiley +1 more source