21 search results - page 3 / 5 » A note on the complexity of minimum dominating set |
COCOON
2005
Springer
14 years 26 days ago
2005
Springer
To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in gr...
MST
2006
13 years 7 months ago
2006
We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of...
CGF
2006
13 years 7 months ago
2006
We propose a new technique for quad-dominant remeshing which separates the local regularity requirements from the global alignment requirements by working in two steps. In the fir...
ICALP
2001
Springer
13 years 11 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
CIE
2007
Springer
14 years 1 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....