646 search results - page 1 / 130 » Generalized connected domination in graphs |
54
Voted
DMTCS
2006
14 years 10 months ago
2006
100
Voted
ICDCS
2010
IEEE
2010
IEEE
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
14 years 10 months ago
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
107
click to vote
ALGORITHMICA
1998
14 years 9 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
JAIR
2008
14 years 10 months ago
2008
We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted clas...
108
click to vote
MOBIHOC
2002
ACM
15 years 9 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...