251 search results - page 1 / 51 » Distributed algorithms for edge dominating sets |
PODC
2010
ACM
13 years 8 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
WADS
2005
Springer
13 years 9 months ago
2005
Springer
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
IPPS
2002
IEEE
13 years 9 months ago
2002
IEEE
This paper addresses the problem of scatternet formation and maintenance for multi-hop Bluetooth based personal area and ad hoc networks with minimal communication overhead. Each ...
IWDC
2005
Springer
13 years 9 months ago
2005
Springer
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
IPPS
2007
IEEE
13 years 10 months ago
2007
IEEE