1477 search results - page 4 / 296 » Complexity of (iterated) dominance |
JDA
2006
15 years 19 days 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
68
Voted
FCT
2005
Springer
15 years 6 months ago
2005
Springer
39
Voted
CORR
2010
Springer
15 years 23 days ago
2010
Springer
CORR
2010
Springer
14 years 9 months ago
2010
Springer
115
click to vote
ISSRE
2005
IEEE
15 years 6 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...