554 search results - page 10 / 111 » Power Domination Problem in Graphs |
135
click to vote
ICDCS
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
112
click to vote
MFCS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
129
click to vote
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...
113
click to vote
APWEB
2006
Springer
15 years 3 months ago
2006
Springer
A Connected Dominating Set (CDS) can serve as a virtual backbone for a wireless sensor network since there is no fixed infrastructure or centralized management in wireless sensor n...
126
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...