721 search results - page 131 / 145 » Bounds on the k-domination number of a graph |
IJFCS
2006
14 years 11 months ago
2006
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this re...
100
click to vote
STOC
2009
ACM
16 years 10 days ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
103
click to vote
PODS
2005
ACM
15 years 12 months ago
2005
ACM
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
MOBIHOC
2008
ACM
15 years 11 months ago
2008
ACM
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
APPROX
2009
Springer
15 years 6 months ago
2009
Springer
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...