Results 1 to 10 of about 252,338 (158)
Minimum Connected Dominating Set Algorithms for Ad Hoc Sensor Networks [PDF]
Sensors, 2019 To achieve effective communication in ad hoc sensor networks, researchers have been working on finding a minimum connected dominating set (MCDS) as a virtual backbone network in practice.
Xuemei Sun, Yongxin Yang, Maode Ma
doaj +2 more sources
Calculation of the Connected Dominating Set Considering Vertex Importance Metrics [PDF]
Entropy, 2018 The computation of a set constituted by few vertices to define a virtual backbone supporting information interchange is a problem that arises in many areas when analysing networks of different natures, like wireless, brain, or social networks.
Francisco Vazquez-Araujo +3 more
doaj +2 more sources
Node Deployment Algorithm for Underwater Sensor Networks Based on Connected Dominating Set [PDF]
Sensors, 2016 Existing node deployment algorithms for underwater sensor networks are nearly unable to improve the network coverage rate under the premise of ensuring the full network connectivity and do not optimize the communication and move energy consumption during
Peng Jiang +4 more
doaj +2 more sources
CONE: A Connected Dominating Set-Based Flooding Protocol for Wireless Sensor Networks [PDF]
Sensors, 2019 Wireless sensor networks (WSNs) play a significant role in a large number of applications, e.g., healthcare and industry. A WSN typically consists of a large number of sensor nodes which rely on limited power sources in many applications.
Dennis Lisiecki +2 more
doaj +2 more sources
A Linear Kernel for Planar Total Dominating Set [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 A total dominating set of a graph $G=(V,E)$ is a subset $D \subseteq V$ such that every vertex in $V$ is adjacent to some vertex in $D$. Finding a total dominating set of minimum size is NP-hard on planar graphs and W[2]-complete on general graphs when ...
Valentin Garnero, Ignasi Sau
doaj +3 more sources
Making a Dominating Set of a Graph Connected
Discussiones Mathematicae Graph Theory, 2018 Let G = (V,E) be a graph and S ⊆ V. We say that S is a dominating set of G, if each vertex in V \ S has a neighbor in S. Moreover, we say that S is a connected (respectively, 2-edge connected or 2-connected) dominating set of G if G[S] is connected ...
Li Hengzhe, Wu Baoyindureng, Yang Weihua
doaj +2 more sources
Open-independent, open-locating-dominating sets [PDF]
Electronic Journal of Graph Theory and Applications, 2017 A distinguishing set for a graph G = (V, E) is a dominating set D, each vertex $v \in D$ being the location of some form of a locating device, from which one can detect and precisely identify any given "intruder" vertex in V(G).
Suk J. Seo, Peter J. Slater
doaj +3 more sources
Connected End Anti-Fuzzy Equitable Dominating Set In Anti-Fuzzy Graphs
Ratio Mathematica, 2023 In this paper, the notion of connected end anti-fuzzy equitable dominating set of an anti-fuzzy graph is discussed. The connected end anti-fuzzy equitable domination number for some standard graphs are obtained.
Janofer K, S.Firthous Fatima
doaj +1 more source
Approximating k-Connected m-Dominating Sets [PDF]
Algorithmica, 2022 A subset $S$ of nodes in a graph $G$ is a $k$-connected $m$-dominating set ($(k,m)$-cds) if the subgraph $G[S]$ induced by $S$ is $k$-connected and every $v \in V \setminus S$ has at least $m$ neighbors in $S$. In the $k$-Connected $m$-Dominating Set ($(k,m)$-CDS) problem the goal is to find a minimum weight $(k,m)$-cds in a node-weighted graph. For $m
openaire +5 more sources
On Hop Roman Domination in Trees [PDF]
Communications in Combinatorics and Optimization, 2019 Let $G=(V,E)$ be a graph. A subset $S\subset V$ is a hop dominating set if every vertex outside $S$ is at distance two from a vertex of $S$. A hop dominating set $S$ which induces a connected subgraph is called a connected hop dominating set of $G$.
N. Jafari Rad, A. Poureidi
doaj +1 more source