1477 search results - page 13 / 296 » Complexity of (iterated) dominance |
159
click to vote
COMPGEOM
1995
ACM
15 years 9 months ago
1995
ACM
We consider the problem of reporting the pairwise enclosures in a set of n axesparallel rectangles in IR2, which is equivalent to reporting dominance pairs in a set of n points in...
161
click to vote
IWCMC
2006
ACM
16 years 14 hour ago
2006
ACM
One important characteristic of wireless sensor networks is energy stringency. Constructing a connected dominating set (CDS) has been widely used as a topology control strategy to...
156
click to vote
TCS
1998
15 years 5 months ago
1998
![Threshold Dominating Sets and an Improved Characterization of W[2]](http://sciweavers.com/files/imagecache/thumbnail/imagecache/threshold_dominating_sets_and_an_improved_characterization_of_w_2_TCS_1998.jpg "Threshold Dominating Sets and an Improved Characterization of W[2]")
The Threshold Dominating Set problem is that of determining for a graph G = (V, E) whether there is a subset V ⊆ V of size k, such that for each vertex v ∈ V there are at leas...
282
click to vote
DCOSS
2011
Springer
14 years 5 months ago
2011
Springer
—Available algorithms for the distributed construction of connected dominating sets in mobile ad hoc networks are inapplicable or suffer from a high complexity. This is mainly du...
153
click to vote
TARK
2009
Springer
16 years 18 days ago
2009
Springer
Brandenburger, Friedenberg, and Keisler provide an epistemic characterization of iterated admissibility (i.e., iterated deletion of weakly dominated strategies) where uncertainty ...