174 search results - page 9 / 35 » Connected dominating sets on dynamic geometric graphs |
168
click to vote
WETICE
2007
IEEE
16 years 8 days ago
2007
IEEE
Designing a collaborative architecture for real-time applications is an intricate challenge that usually involves dealing with the real-time constraints, resource limitations and ...
181
click to vote
IWDC
2005
Springer
15 years 11 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...
166
click to vote
JCO
2007
15 years 5 months ago
2007
In a graph G, a vertex dominates itself and its neighbors. A subset S ⊆ V (G) is an m-tuple dominating set if S dominates every vertex of G at least m times, and an m-dominating...
172
click to vote
SIAMDM
2008
15 years 6 months ago
2008
The power system monitoring problem asks for as few as possible measurement devices to be put in an electric power system. The problem has a graph theory model involving power dom...
189
click to vote
MFCS
2004
Springer
15 years 11 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....