249 search results - page 45 / 50 » The upper bound on k-tuple domination numbers of graphs |
SWAT
2004
Springer
14 years 21 days ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
DAM
2011
13 years 2 months ago
2011
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...
MOBIHOC
2008
ACM
14 years 7 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
14 years 1 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...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— We consider the problem of throughput-optimal cross-layer design of wireless networks. We propose a joint congestion control and scheduling algorithm that achieves a fraction d...