406 search results - page 5 / 82 » Dominating Sets in Web Graphs |
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We show that the k-Dominating Set problem is fixed parameter tractable (FPT) and has a polynomial kernel for any class of
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
SODA
2003
ACM
13 years 9 months ago
2003
ACM
CORR
2004
Springer
13 years 7 months ago
2004
Springer
