370 search results - page 24 / 74 » Computational Study on Dominating Set Problem of Planar Grap... |
113
click to vote
MOBIHOC
2008
ACM
15 years 11 months ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
101
click to vote
SNPD
2007
15 years 1 months ago
2007
Source and destination location privacy is a challenging and important problem in sensor networks. Nevertheless, privacy preserving communication in sensor networks is still a vir...
101
click to vote
ICALP
2001
Springer
15 years 4 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
CSJM
2006
14 years 11 months ago
2006
The Nash equilibria set (NES) is described as an intersection of graphs of best response mappings. The problem of NES computing for multi-matrix extended games is considered. A me...
113
click to vote
ISAAC
2007
Springer
15 years 5 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...