Sciweavers

11 search results - page 3 / 3
» Weighted Zeta Functions of Graph Coverings
Sort
View
IWDC
2005
Springer
138views Communications» more  IWDC 2005»
13 years 10 months ago
Hierarchical Routing in Sensor Networks Using k-Dominating Sets
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...
Michael Q. Rieck, Subhankar Dhar