Results 251 to 260 of about 5,986,669 (282)
Some of the next articles are maybe not open access.
Approximation Algorithms for Steiner Connected Dominating Set
Journal of Computer Science and Technology, 2005Steiner connected dominating set (SCDS) is a generalization of the famous connected dominating set problem, where only a specified set of required vertices has to be dominated by a connected dominating set, and known to be NP-hard. This paper firstly modifies the SCDS algorithm of Guha and Khuller and achieves a worst case approximation ratio of (2+1 ...
Ya-feng Wu +2 more
openaire +2 more sources
CONNECTED dr-POWER DOMINATING SETS IN GRAPHS
Advances and Applications in Discrete Mathematics, 2018Summary: Let \(G\) be a simple graph. A set \(P\subseteq V(G)\) is called a connected \(dr\)-power dominating set of \(G\) if it is a \(dr\)-power dominating set and the induced subgraph of \(P\), denoted by \(\langle P\rangle\), is connected. The minimum cardinality of a connected \(dr\)-power dominating set \(P\) of a graph \(G\), denoted by \(\gamma^
Cabahug, Isagani S. jun. +1 more
openaire +2 more sources
OUTER-CONNECTED 2-DOMINATING SETS OF GRAPHS
Advances and Applications in Discrete Mathematics, 2019Summary: Let \(G=(V(G), E(G))\) be a simple graph. A subset \(S\) of \(V(G)\) is an outer-connected 2-dominating set of \(G\) if \(S\) is a 2-dominating set of \(G\) and the graph \(\langle V(G)\backslash S\rangle\) is connected. The outer-connected 2-domination number of \(G\), denoted by \(\gamma^c_2(G)\), is the smallest cardinality of an outer ...
Canoy, Sergio R. jun. +1 more
openaire +1 more source
An Improved Kernel for Planar Connected Dominating Set
2011In this paper, we study the Planar Connected Dominating Set problem, which, given a planar graph G = (V,E) and a non-negative integer k, asks for a subset D ⊆ V with |D| ≤ k such that D forms a dominating set of G and induces a connected graph. Answering an open question by S.
Weizhong Luo +4 more
openaire +2 more sources
Distributed Dominating Set and Connected Dominating Set Construction Under the Dynamic SINR Model
2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2019This paper investigates distributed Dominating Set (DS) and Connected Dominating Set (CDS) construction in dynamic wireless networks under the SINR interference model. Specifically, we present a new model for dynamic networks that admits both churns (due to node arrivals/departures) and node mobility.
Dongxiao Yu +7 more
openaire +2 more sources
Steiner set and connected domination in trapezoid graphs
Information Processing Letters, 1995Abstract Trapezoid graphs are extensions of interval graphs and permutation graphs. This paper presents an O (¦V¦) time algorithm for finding a minimum cardinality Steiner set and an O (¦E¦ + ¦V¦) time algorithm for finding a minimum cardinality connected dominating set in a trapezoid graph G = ( V , E ), given the trapezoid diagram.
openaire +1 more source
Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming
2012In this paper, we propose several integer programming approaches with a polynomial number of constraints to formulate and solve the minimum connected dominating set problem. Further, we consider both the power dominating set problem – a special dominating set problem for sensor placement in power systems – and its connected version.
Neng Fan, Jean-Paul Watson
openaire +2 more sources
On approximability of the independent/connected edge dominating set problems
Information Processing Letters, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
VERY EXCELLENT DOMINATING WEAKLY CONNECTED SET DOMINATING SETS
Advances in Mathematics: Scientific Journal, 2020D. Anandha Selvam +1 more
openaire +1 more source