10916 search results - page 8 / 2184 » On Constructive Connectives and Systems |
107
click to vote
EJC
2008
14 years 8 months ago
2008
A matroid M is sequential or has path width 3 if M is 3-connected and its ground set has a sequential ordering, that is, an ordering (e1, e2, . . . , en) such that ({e1, e2, . . . ...
IWCMC
2006
ACM
15 years 3 months ago
2006
ACM
One important characteristic of wireless sensor networks is energy stringency. Constructing a connected dominating set (CDS) has been widely used as a topology control strategy to...
100
click to vote
TMC
2008
14 years 9 months ago
2008
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
160
click to vote
DCOSS
2011
Springer
13 years 9 months ago
2011
Springer
—Available algorithms for the distributed construction of connected dominating sets in mobile ad hoc networks are inapplicable or suffer from a high complexity. This is mainly du...
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...