1477 search results - page 4 / 296 » Complexity of (iterated) dominance |
JDA
2006
13 years 11 months ago
2006
The currently (asymptotically) fastest algorithm for minimum dominating set on graphs of n nodes is the trivial (2n) algorithm which enumerates and checks all the subsets of
FCT
2005
Springer
14 years 4 months ago
2005
Springer
CORR
2010
Springer
13 years 11 months ago
2010
Springer
CORR
2010
Springer
13 years 7 months ago
2010
Springer
ISSRE
2005
IEEE
14 years 4 months ago
2005
IEEE
Code prioritization for testing promises to achieve the maximum testing coverage with the least cost. This paper presents an innovative method to provide hints on which part of co...