174 search results - page 6 / 35 » Connected dominating sets on dynamic geometric graphs |
121
click to vote
COCOON
2007
Springer
15 years 5 months ago
2007
Springer
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...
CORR
2004
Springer
14 years 11 months ago
2004
Springer
SODA
2008
ACM
15 years 1 months ago
2008
ACM
125
click to vote
MOBIHOC
2002
ACM
15 years 11 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
128
Voted
MST
2010
14 years 6 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...