Results 241 to 250 of about 5,986,669 (282)
Beyond Binary: Cardiac Patterning as Probabilistic Fate Restriction. [PDF]
BioessaysIvanovitch K.
europepmc +1 more source
Indices of trophic and competitive relationships in a planktonic meta-network of carp ponds. [PDF]
Sci RepGoździejewska AM +4 more
europepmc +1 more source
Minimum Connected Dominating Set for Certain Circulant Networks [PDF]
Procedia Computer Science, 2015 A Minimum Connected Dominating Set is a minimum set of connected nodes such that every other node in the network is one hop connected with a node in this set. In general, the problemis proved to be NP-hard.
Indra Rajasingh +2 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2-Edge connected dominating sets and 2-Connected dominating sets of a graph
Journal of Combinatorial Optimization, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hengzhe Li, Yuxing Yang, Baoyindureng Wu
openaire +1 more source
A greedy approximation for minimum connected dominating sets
Theoretical Computer Science, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaohua Jia, Weili Lily Wu, Yingshu Li
exaly +3 more sources
Connected dominating sets and connected domination polynomials of square of centipedes
Journal of Information and Optimization Sciences, 2016AbstractLet G be a simple connected graph. The connected domination polynomial of G is defined by , where γd(G) is the connected domination number of G. In this paper, we find the connected dominating sets of and a recursive formula is obtained. Also, we construct the connected domination polynomial of and some interesting properties between the ...
A Vijayan
exaly +2 more sources
Below All Subsets for Minimal Connected Dominating Set [PDF]
SIAM Journal on Discrete Mathematics, 2018 A vertex subset $S$ in a graph $G$ is a dominating set if every vertex not contained in $S$ has a neighbor in $S$. A dominating set $S$ is a connected dominating set if the subgraph $G[S]$ induced by $S$ is connected. A connected dominating set $S$ is a minimal connected dominating set if no proper subset of $S$ is also a connected dominating set.
Saket Saurabh +2 more
exaly +7 more sources
Information Processing Letters, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oliver Schaudt
exaly +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oliver Schaudt
exaly +3 more sources
GRASP for connected dominating set problems
Neural Computing and Applications, 2016The minimum connected dominating set problem, a variant of the classical minimum dominating set problem, is a very significant NP-hard combinatorial optimization problem with a number of applications. To address this problem, a greedy randomized adaptive search procedure (GRASP) that incorporates a novel local search procedure based on greedy function ...
Ruizhi Li +5 more
openaire +2 more sources
Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set
2010We prove a small linear-size kernel for the connected dominating set problem in planar graphs through data reduction. Our set of rules efficiently reduce a planar graph G with n vertices and connected dominating number γc(G) to a kernel of size at most 413γc(G) in O(n3) time answering the question of whether the connectivity criteria hinders the ...
Qianping Gu, Navid Imani
openaire +1 more source