Making a Dominating Set of a Graph Connected [PDF]
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 +4 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 +4 more sources
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
Linear kernel for planar connected dominating set [PDF]
Theoretical Computer Science, 2009 We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and analyze these to obtain a linear kernel for the planar Connected Dominating Set problem.
Lokshtanov, D. +4 more
core +6 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
Connected odd dominating sets in graphs [PDF]
Discussiones Mathematicae Graph Theory, 2005 An odd dominating set of a simple, undirected graph G = (V,E) is a set of vertices D ⊆ V such that |N[v] ∩ D| ≡ 1 mod 2 for all vertices v ∈ V. It is known that every graph has an odd dominating set. In this paper we consider the concept of connected odd
Caro, Yair +2 more
core +3 more sources
Study on a Strong and Weak n-Connected Total Perfect k-Dominating set in Fuzzy Graphs [PDF]
Mathematics, 2022 In this paper, the concept of a strong n-Connected Total Perfect k-connected total perfect k-dominating set and a weak n-connected total perfect k-dominating set in fuzzy graphs is introduced.
Krishnasamy Elavarasan +3 more
doaj +2 more sources
Visual navigation in unmanned air vehicles with simultaneous location and mapping (SLAM) [PDF]
, 2014 © Cranfield University, 2013This thesis focuses on the theory and implementation of visual navigation techniques for Autonomous Air Vehicles in outdoor environments.
Li, X
core +7 more sources
An exact algorithm for connected red–blue dominating set
Journal of Discrete Algorithms, 2015 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 ...
Abu-Khzam, Faisal N. +2 more
core +8 more sources