241 search results - page 38 / 49 » Degree Bounded Spanning Trees |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The energy scaling laws of multihop data fusion networks for distributed inference are considered. The fusion network consists of randomly located sensors independently distributed...
DISOPT
2010
13 years 7 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
SWAT
2004
Springer
14 years 22 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...
STACS
2005
Springer
14 years 26 days ago
2005
Springer
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We ...
DM
2010
13 years 7 months ago
2010
For d 1, s 0 a (d,d +s)-graph is a graph whose degrees all lie in the interval {d,d +1,...,d +s}. For r 1, a 0 an (r,r+1)-factor of a graph G is a spanning (r,r+a)-subgraph of...