Results 71 to 80 of about 252,358 (178)
Complexity, 2020 In a wireless ad hoc network, the size of the virtual backbone (VB) is an important factor for measuring the quality of the VB. The smaller the VB is, the less the overhead caused by the VB.
Jiarong Liang +5 more
doaj +1 more source
Factor-Critical Property in 3-Dominating-Critical Graphs
, 2006 A vertex subset $S$ of a graph $G$ is a dominating set if every vertex of $G$ either belongs to $S$ or is adjacent to a vertex of $S$. The cardinality of a smallest dominating set is called the dominating number of $G$ and is denoted by $\gamma(G)$.
Wang, Tao, Yu, Qinglin
core
Minimum Connected Dominating Sets of Random Cubic Graphs [PDF]
The Electronic Journal of Combinatorics, 2002 We present a simple heuristic for finding a small connected dominating set of cubic graphs. The average-case performance of this heuristic, which is a randomised greedy algorithm, is analysed on random $n$-vertex cubic graphs using differential equations.
openaire +2 more sources
Constructing a CDS-Based Network Backbone for Data Collection in Wireless Sensor Networks
International Journal of Distributed Sensor Networks, 2013 Data collection is one of the most important operations in wireless sensor networks. Currently, many researches focus on using a connected dominating set to construct a virtual backbone for data collection in WSNs.
Xiaoyan Kui +3 more
doaj +1 more source
Linear separation of connected dominating sets in graphs
Ars Mathematica Contemporanea, 2019 32 pages, 8 ...
Chiarelli, Nina, Milanič, Martin
openaire +6 more sources
Online Connected Dominating Set Leasing
, 2018 We introduce the \emph{Online Connected Dominating Set Leasing} problem (OCDSL) in which we are given an undirected connected graph $G = (V, E)$, a set $\mathcal{L}$ of lease types each characterized by a duration and cost, and a sequence of subsets of $V$ arriving over time.
openaire +2 more sources
An Exact Algorithm for Connected Red-Blue Dominating Set
Journal of Discrete Algorithms, 2010 In the Connected Red-Blue Dominating Set problem we are given a graph G whose vertex set is partitioned into two parts R and B (red and blue vertices), and we are asked to find a connected subgraph induced by a subset S of B such that each red vertex of G is adjacent to some vertex in S. The problem can be solved in $O*(2^{n-|B|})$ time by reduction to
Abu-Khzam, Faisal +2 more
openaire +5 more sources
Two Short Proofs on Total Domination
Discussiones Mathematicae Graph Theory, 2013 A set of vertices of a graph G is a total dominating set if each vertex of G is adjacent to a vertex in the set. The total domination number of a graph Υt (G) is the minimum size of a total dominating set.
Bickle Allan
doaj +1 more source
International Journal of Distributed Sensor Networks, 2019 Due to the increased demand of wireless sensor networks for their characteristics like low energy consumption, robustness, and low cost in several demanding and complex applications like smart grid, health and safety, traffic and weather updates, there ...
Jaffar Ali +5 more
doaj +1 more source
Locating-total dominating sets in twin-free graphs: a conjecture
, 2016 A total dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every vertex of $G$ has a neighbor in $D$. A locating-total dominating set of $G$ is a total dominating set $D$ of $G$ with the additional property that every two distinct ...
Foucaud, Florent, Henning, Michael A.
core