59 search results - page 1 / 12 » Real and integer domination in graphs |
DM
1999
14 years 10 months ago
1999
For an arbitrary subset P of the reals, we define a function f: V P to be a Pdominating function of graph G = (V, E) if the sum of the function values over any
DM
2006
14 years 10 months ago
2006
Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that different vertices can be assigned different domination...
113
Voted
FSTTCS
2010
Springer
14 years 8 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
99
Voted
SODA
2012
ACM
13 years 19 days ago
2012
ACM
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
79
Voted
JCO
2007
14 years 10 months ago
2007
In a graph G, a vertex dominates itself and its neighbors. A subset S ⊆ V (G) is an m-tuple dominating set if S dominates every vertex of G at least m times, and an m-dominating...