Sciweavers

Share
DM
2006

Optimal broadcast domination in polynomial time

9 years 7 months ago
Optimal broadcast domination in polynomial time
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 powers. Broadcast domination assigns an integer power f(v) 0 to each vertex v of a given graph, such that every vertex of the graph is within distance
Pinar Heggernes, Daniel Lokshtanov
Added 11 Dec 2010
Updated 11 Dec 2010
Type Journal
Year 2006
Where DM
Authors Pinar Heggernes, Daniel Lokshtanov
Comments (0)
books