Results 1  10
of
958,076
Approximation Algorithms for Connected Dominating Sets
 Algorithmica
, 1996
"... The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to either be in the dominating set, or adjacent to some node in the dominating set. We focus on the question of finding a connected dominating set of minimum size, whe ..."
Abstract

Cited by 376 (9 self)
 Add to MetaCart
The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to either be in the dominating set, or adjacent to some node in the dominating set. We focus on the question of finding a connected dominating set of minimum size
On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks
, 1999
"... Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in adhoc wireless networks. Routing based on a connected dominating set is a frequently used approach, where the searching space for a route is reduced to nodes in the set. A set is dominating i ..."
Abstract

Cited by 384 (41 self)
 Add to MetaCart
Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in adhoc wireless networks. Routing based on a connected dominating set is a frequently used approach, where the searching space for a route is reduced to nodes in the set. A set is dominating
Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks
 Mobile Networks and Applications
, 2002
"... Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the literature for minimum CDS. ..."
Abstract

Cited by 277 (21 self)
 Add to MetaCart
Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the literature for minimum CDS.
Connected Domination of Regular Graphs
, 2008
"... A dominating set D of a graph G is a subset of V (G) such that for every vertex v ∈ V (G), either v ∈ D or there exists a vertex u ∈ D that is adjacent to v in G. Dominating sets of small cardinality are of interest. A connected dominating set C of a graph G is a dominating set of G such that the su ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A dominating set D of a graph G is a subset of V (G) such that for every vertex v ∈ V (G), either v ∈ D or there exists a vertex u ∈ D that is adjacent to v in G. Dominating sets of small cardinality are of interest. A connected dominating set C of a graph G is a dominating set of G
Routing in AdHoc Networks Using Minimum Connected Dominating Sets
, 1997
"... this paper, we impose a virtual backbone structure on the adhoc network, in order to support unicast, multicast, and faulttolerant routing within the adhoc network. This virtual backbone differs from the wired backbone of cellular networks in two key ways: (a) it may change as nodes move, and (b) ..."
Abstract

Cited by 303 (3 self)
 Add to MetaCart
, to keep the virtual backbone as small as possible, we use an approximation to the minimum connected dominating set (MCDS) of the adhoc network topology as the virtual backbone. The hosts in the MCDS maintain local copies of the global topology of the network, along with shortest paths between all pairs
On Weaklyconnected Domination in Graphs
"... Let G = (V, E) be a connected undirected graph. For any vertex v # V , the closed neighborhood of v is N [v] = {v} # { u # V  uv # E }. For S # V , the closed neighborhood of S is N [S] = S v#S N [v]. The subgraph weakly induced by S is #S# w = (N [S], E # (S × N [S])). A set ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
set S is a weaklyconnected dominating set of G if S is dominating and #S# w is connected. The weaklyconnected domination number is #w (G) = min{ S  S is a weaklyconnected dominating set of G }, and the upper weaklyconnected domination number is #w (G) = max{ S  S is a minimal weaklyconnected
Generalized connected domination in graphs
"... As a generalization of connected domination in a graph G we consider domination by sets having at most k components. The order γ k c (G) of such a smallest set we relate to γc(G), the order of a smallest connected dominating set. For a tree T we give bounds on γ k c (T) in terms of minimum valency a ..."
Abstract
 Add to MetaCart
As a generalization of connected domination in a graph G we consider domination by sets having at most k components. The order γ k c (G) of such a smallest set we relate to γc(G), the order of a smallest connected dominating set. For a tree T we give bounds on γ k c (T) in terms of minimum valency
Connected Dominating Sets
"... Wireless sensor networks (WSNs), consist of small nodes with sensing, computation, and wireless communications capabilities, are now widely used in many applications, including environment and habitat monitoring, traffic control, and etc. Routing in WSNs is very challenging due to the inherent chara ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
. As such, the concept of hierarchical routing is also utilized to perform energyefficient routing in WSNs. Using a virtual backbone infrastructure which is one kind of hierarchical methods has received more attention. Thus, a Connected Dominating Set (CDS) has been recommended to serve as a virtual
TOTAL OUTERCONNECTED DOMINATION IN TREES
"... Let G = (V; E) be a graph. Set D V (G) is a total outerconnected dominating set of G if D is a total dominating set in G and G[V (G)D] is connected. The total outerconnected domination number of G, denoted by
tc(G), is the smallest cardinality of a total outerconnected dominating set of G. We s ..."
Abstract
 Add to MetaCart
Let G = (V; E) be a graph. Set D V (G) is a total outerconnected dominating set of G if D is a total dominating set in G and G[V (G)D] is connected. The total outerconnected domination number of G, denoted by
tc(G), is the smallest cardinality of a total outerconnected dominating set of G. We
Results 1  10
of
958,076